./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7566a205875353a7a53577ca4c9ca94a9d2d53458c01e4aa6bab26ab44feec5a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:43:55,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:43:55,388 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:43:55,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:43:55,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:43:55,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:43:55,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:43:55,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:43:55,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:43:55,417 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:43:55,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:43:55,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:43:55,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:43:55,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:43:55,420 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:43:55,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:43:55,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:43:55,422 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:43:55,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:43:55,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:43:55,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:43:55,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:43:55,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:43:55,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:43:55,426 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:43:55,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:43:55,427 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:43:55,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:43:55,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:43:55,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:43:55,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:43:55,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:43:55,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:43:55,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:43:55,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:43:55,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:43:55,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:43:55,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:43:55,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:43:55,431 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:43:55,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:43:55,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:43:55,433 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7566a205875353a7a53577ca4c9ca94a9d2d53458c01e4aa6bab26ab44feec5a [2023-11-29 04:43:55,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:43:55,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:43:55,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:43:55,685 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:43:55,685 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:43:55,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i [2023-11-29 04:43:58,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:43:58,592 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:43:58,592 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i [2023-11-29 04:43:58,601 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/data/0edf6c4d1/fe7bcec13a504b948248d9fde23f03f9/FLAG0277d3191 [2023-11-29 04:43:58,613 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/data/0edf6c4d1/fe7bcec13a504b948248d9fde23f03f9 [2023-11-29 04:43:58,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:43:58,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:43:58,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:43:58,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:43:58,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:43:58,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e87bd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58, skipping insertion in model container [2023-11-29 04:43:58,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,653 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:43:58,805 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i[915,928] [2023-11-29 04:43:58,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:43:58,851 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:43:58,864 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i[915,928] [2023-11-29 04:43:58,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:43:58,899 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:43:58,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58 WrapperNode [2023-11-29 04:43:58,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:43:58,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:43:58,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:43:58,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:43:58,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,943 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2023-11-29 04:43:58,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:43:58,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:43:58,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:43:58,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:43:58,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,971 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:43:58,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:43:58,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:43:58,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:43:58,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:43:58,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (1/1) ... [2023-11-29 04:43:58,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:43:59,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:43:59,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:43:59,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:43:59,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:43:59,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:43:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:43:59,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:43:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:43:59,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:43:59,105 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:43:59,107 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:43:59,322 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:43:59,362 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:43:59,362 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:43:59,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:43:59 BoogieIcfgContainer [2023-11-29 04:43:59,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:43:59,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:43:59,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:43:59,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:43:59,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:43:58" (1/3) ... [2023-11-29 04:43:59,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6f567e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:43:59, skipping insertion in model container [2023-11-29 04:43:59,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:43:58" (2/3) ... [2023-11-29 04:43:59,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6f567e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:43:59, skipping insertion in model container [2023-11-29 04:43:59,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:43:59" (3/3) ... [2023-11-29 04:43:59,372 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-41.i [2023-11-29 04:43:59,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:43:59,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:43:59,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:43:59,449 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@341ebb8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:43:59,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:43:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 04:43:59,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:59,467 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:59,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:59,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2117070649, now seen corresponding path program 1 times [2023-11-29 04:43:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159497039] [2023-11-29 04:43:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:43:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:43:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:43:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:43:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:43:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:43:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:43:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:43:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:43:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:43:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:43:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:43:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:43:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:43:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:43:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:43:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:43:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159497039] [2023-11-29 04:43:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159497039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:59,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:59,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:43:59,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007207771] [2023-11-29 04:43:59,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:59,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:43:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:59,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:43:59,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:43:59,857 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:43:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:59,898 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2023-11-29 04:43:59,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:43:59,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2023-11-29 04:43:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:59,908 INFO L225 Difference]: With dead ends: 88 [2023-11-29 04:43:59,908 INFO L226 Difference]: Without dead ends: 42 [2023-11-29 04:43:59,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:43:59,916 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:59,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:43:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-29 04:43:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-29 04:43:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:43:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2023-11-29 04:43:59,960 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 99 [2023-11-29 04:43:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:59,960 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2023-11-29 04:43:59,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:43:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2023-11-29 04:43:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 04:43:59,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:59,966 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:59,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:43:59,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:43:59,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1105653959, now seen corresponding path program 1 times [2023-11-29 04:43:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824870157] [2023-11-29 04:43:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:44:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:44:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:44:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:44:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:44:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:44:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:44:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:44:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:44:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:44:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:44:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:44:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:44:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:44:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:44:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:44:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:44:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:44:01,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:44:01,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824870157] [2023-11-29 04:44:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824870157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:44:01,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:44:01,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:44:01,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812055036] [2023-11-29 04:44:01,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:44:01,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:44:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:44:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:44:01,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:44:01,932 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:44:02,384 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2023-11-29 04:44:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:44:02,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-29 04:44:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:44:02,388 INFO L225 Difference]: With dead ends: 70 [2023-11-29 04:44:02,388 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 04:44:02,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:44:02,390 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:44:02,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 233 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:44:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 04:44:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. [2023-11-29 04:44:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:44:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2023-11-29 04:44:02,404 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 99 [2023-11-29 04:44:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:44:02,406 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2023-11-29 04:44:02,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2023-11-29 04:44:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 04:44:02,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:44:02,408 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:44:02,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:44:02,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:44:02,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:44:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1414305975, now seen corresponding path program 1 times [2023-11-29 04:44:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:44:02,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823296422] [2023-11-29 04:44:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:44:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:44:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:44:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:44:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:44:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:44:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:44:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:44:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:44:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:44:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:44:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:44:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:44:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:44:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:44:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:44:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:44:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:44:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:44:03,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:44:03,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823296422] [2023-11-29 04:44:03,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823296422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:44:03,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:44:03,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:44:03,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510696151] [2023-11-29 04:44:03,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:44:03,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:44:03,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:44:03,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:44:03,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:44:03,487 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:44:03,748 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2023-11-29 04:44:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:44:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-29 04:44:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:44:03,754 INFO L225 Difference]: With dead ends: 139 [2023-11-29 04:44:03,754 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 04:44:03,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:44:03,756 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 65 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:44:03,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 279 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:44:03,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 04:44:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2023-11-29 04:44:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 04:44:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2023-11-29 04:44:03,777 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 99 [2023-11-29 04:44:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:44:03,778 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2023-11-29 04:44:03,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2023-11-29 04:44:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 04:44:03,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:44:03,780 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:44:03,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:44:03,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:44:03,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:44:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1785712329, now seen corresponding path program 1 times [2023-11-29 04:44:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:44:03,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335569364] [2023-11-29 04:44:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:44:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:44:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:44:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:44:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:44:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:44:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:44:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:44:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:44:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:44:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:44:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:44:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:44:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:44:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:44:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:44:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:44:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:44:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:44:04,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:44:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335569364] [2023-11-29 04:44:04,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335569364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:44:04,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:44:04,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:44:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324034311] [2023-11-29 04:44:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:44:04,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:44:04,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:44:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:44:04,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:44:04,883 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:44:05,307 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2023-11-29 04:44:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:44:05,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-29 04:44:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:44:05,311 INFO L225 Difference]: With dead ends: 101 [2023-11-29 04:44:05,311 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 04:44:05,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:44:05,313 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 30 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:44:05,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 226 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:44:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 04:44:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2023-11-29 04:44:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 61 states have internal predecessors, (71), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 04:44:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2023-11-29 04:44:05,333 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 99 [2023-11-29 04:44:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:44:05,333 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2023-11-29 04:44:05,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2023-11-29 04:44:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 04:44:05,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:44:05,336 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:44:05,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:44:05,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:44:05,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:44:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash -734247605, now seen corresponding path program 1 times [2023-11-29 04:44:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:44:05,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619375935] [2023-11-29 04:44:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:44:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:44:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:44:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:44:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:44:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:44:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:44:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:44:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:44:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:44:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:44:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:44:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:44:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:44:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:44:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:44:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:44:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:44:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:44:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:44:06,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619375935] [2023-11-29 04:44:06,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619375935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:44:06,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:44:06,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:44:06,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130966744] [2023-11-29 04:44:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:44:06,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:44:06,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:44:06,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:44:06,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:44:06,077 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:44:06,369 INFO L93 Difference]: Finished difference Result 104 states and 137 transitions. [2023-11-29 04:44:06,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:44:06,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-29 04:44:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:44:06,372 INFO L225 Difference]: With dead ends: 104 [2023-11-29 04:44:06,372 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 04:44:06,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:44:06,373 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 34 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:44:06,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:44:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 04:44:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2023-11-29 04:44:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 04:44:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2023-11-29 04:44:06,394 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 99 [2023-11-29 04:44:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:44:06,395 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2023-11-29 04:44:06,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2023-11-29 04:44:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 04:44:06,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:44:06,397 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:44:06,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:44:06,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:44:06,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:44:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash -93998736, now seen corresponding path program 1 times [2023-11-29 04:44:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:44:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025881624] [2023-11-29 04:44:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:44:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:44:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:44:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:44:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:44:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:44:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:44:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:44:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:44:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:44:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:44:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:44:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:44:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:44:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:44:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:44:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:44:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:44:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:44:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:44:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025881624] [2023-11-29 04:44:06,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025881624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:44:06,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:44:06,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:44:06,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801606091] [2023-11-29 04:44:06,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:44:06,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:44:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:44:06,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:44:06,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:44:06,518 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:44:06,544 INFO L93 Difference]: Finished difference Result 160 states and 221 transitions. [2023-11-29 04:44:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:44:06,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-11-29 04:44:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:44:06,545 INFO L225 Difference]: With dead ends: 160 [2023-11-29 04:44:06,545 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:44:06,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:44:06,548 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:44:06,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:44:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:44:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:44:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:44:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:44:06,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2023-11-29 04:44:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:44:06,550 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:44:06,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:44:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:44:06,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:44:06,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:44:06,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:44:06,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:44:06,755 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-11-29 04:44:06,755 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-11-29 04:44:06,755 INFO L902 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: true [2023-11-29 04:44:06,755 INFO L902 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: true [2023-11-29 04:44:06,756 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-11-29 04:44:06,756 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 04:44:06,756 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 04:44:06,756 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 04:44:06,756 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-29 04:44:06,756 INFO L902 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: true [2023-11-29 04:44:06,756 INFO L902 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: true [2023-11-29 04:44:06,756 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-11-29 04:44:06,756 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-29 04:44:06,757 INFO L895 garLoopResultBuilder]: At program point L98-3(lines 98 104) the Hoare annotation is: (let ((.cse7 (div ~var_1_10~0 4294967296)) (.cse4 (* (div ~var_1_9~0 256) 256))) (let ((.cse5 (= (+ 2 ~var_1_7~0) 0)) (.cse0 (= .cse4 ~var_1_9~0)) (.cse1 (= ~var_1_8~0 0)) (.cse2 (* .cse7 4294967296)) (.cse3 (* 4294967295 ~var_1_13~0))) (or (and (or (= (+ (* (div ~var_1_8~0 256) 256) 1) ~var_1_8~0) .cse0) (or (not .cse0) .cse1) (= (+ .cse2 .cse3 ~var_1_12~0 ~var_1_11~0) (+ (* (div (+ .cse3 ~var_1_12~0 ~var_1_11~0) 4294967296) 4294967296) ~var_1_10~0)) (<= (+ ~var_1_12~0 ~var_1_11~0) (+ ~var_1_13~0 ~var_1_10~0)) (or (< .cse4 ~var_1_9~0) (not .cse5))) (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (let ((.cse6 (div (+ .cse3 ~var_1_14~0) 4294967296))) (and .cse5 (<= .cse6 (+ .cse7 ~var_1_13~0)) (= (+ 2 ~var_1_1~0) 0) .cse0 .cse1 (= (+ .cse2 .cse3 ~var_1_14~0) (+ ~var_1_10~0 (* 4294967296 .cse6)))))))) [2023-11-29 04:44:06,757 INFO L899 garLoopResultBuilder]: For program point L98-4(lines 98 104) no Hoare annotation was computed. [2023-11-29 04:44:06,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 04:44:06,757 INFO L899 garLoopResultBuilder]: For program point L86(lines 62 87) no Hoare annotation was computed. [2023-11-29 04:44:06,757 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-29 04:44:06,758 INFO L902 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: true [2023-11-29 04:44:06,758 INFO L902 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: true [2023-11-29 04:44:06,758 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-29 04:44:06,758 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-11-29 04:44:06,758 INFO L899 garLoopResultBuilder]: For program point L41-2(lines 36 61) no Hoare annotation was computed. [2023-11-29 04:44:06,758 INFO L902 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: true [2023-11-29 04:44:06,758 INFO L902 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: true [2023-11-29 04:44:06,759 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2023-11-29 04:44:06,759 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 39) no Hoare annotation was computed. [2023-11-29 04:44:06,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:44:06,759 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-11-29 04:44:06,759 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-11-29 04:44:06,759 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-11-29 04:44:06,760 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-29 04:44:06,760 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:44:06,760 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-29 04:44:06,760 INFO L902 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: true [2023-11-29 04:44:06,760 INFO L902 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: true [2023-11-29 04:44:06,761 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-29 04:44:06,761 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-11-29 04:44:06,761 INFO L902 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: true [2023-11-29 04:44:06,761 INFO L902 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: true [2023-11-29 04:44:06,761 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-29 04:44:06,761 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 04:44:06,761 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 04:44:06,761 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 04:44:06,762 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 04:44:06,765 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 04:44:06,767 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:44:06,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:44:06 BoogieIcfgContainer [2023-11-29 04:44:06,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:44:06,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:44:06,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:44:06,782 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:44:06,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:43:59" (3/4) ... [2023-11-29 04:44:06,784 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:44:06,788 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 04:44:06,793 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 04:44:06,794 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 04:44:06,794 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:44:06,795 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:44:06,892 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:44:06,893 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:44:06,893 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:44:06,894 INFO L158 Benchmark]: Toolchain (without parser) took 8275.22ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 109.0MB in the beginning and 139.9MB in the end (delta: -30.9MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2023-11-29 04:44:06,894 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:44:06,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.01ms. Allocated memory is still 157.3MB. Free memory was 108.4MB in the beginning and 97.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:44:06,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.09ms. Allocated memory is still 157.3MB. Free memory was 96.4MB in the beginning and 95.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:44:06,895 INFO L158 Benchmark]: Boogie Preprocessor took 40.34ms. Allocated memory is still 157.3MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:44:06,896 INFO L158 Benchmark]: RCFGBuilder took 377.96ms. Allocated memory is still 157.3MB. Free memory was 92.2MB in the beginning and 76.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 04:44:06,896 INFO L158 Benchmark]: TraceAbstraction took 7415.29ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 75.5MB in the beginning and 146.2MB in the end (delta: -70.7MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2023-11-29 04:44:06,896 INFO L158 Benchmark]: Witness Printer took 111.61ms. Allocated memory is still 197.1MB. Free memory was 146.2MB in the beginning and 139.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 04:44:06,898 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.01ms. Allocated memory is still 157.3MB. Free memory was 108.4MB in the beginning and 97.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.09ms. Allocated memory is still 157.3MB. Free memory was 96.4MB in the beginning and 95.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.34ms. Allocated memory is still 157.3MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 377.96ms. Allocated memory is still 157.3MB. Free memory was 92.2MB in the beginning and 76.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7415.29ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 75.5MB in the beginning and 146.2MB in the end (delta: -70.7MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Witness Printer took 111.61ms. Allocated memory is still 197.1MB. Free memory was 146.2MB in the beginning and 139.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 1105 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 734 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 371 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 52 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 101 PreInvPairs, 130 NumberOfFragments, 156 HoareAnnotationTreeSize, 101 FomulaSimplifications, 1306 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 278 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 2234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((var_1_8 / 256) * 256) + 1) == var_1_8) || (((var_1_9 / 256) * 256) == var_1_9)) && (!((((var_1_9 / 256) * 256) == var_1_9)) || (var_1_8 == 0))) && ((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_12) + var_1_11) == ((((((4294967295 * var_1_13) + var_1_12) + var_1_11) / 4294967296) * 4294967296) + var_1_10))) && ((var_1_12 + var_1_11) <= (var_1_13 + var_1_10))) && ((((var_1_9 / 256) * 256) < var_1_9) || !(((2 + var_1_7) == 0)))) || (var_1_5 == ((var_1_5 / 256) * 256))) || (((((((2 + var_1_7) == 0) && ((((4294967295 * var_1_13) + var_1_14) / 4294967296) <= ((var_1_10 / 4294967296) + var_1_13))) && ((2 + var_1_1) == 0)) && (((var_1_9 / 256) * 256) == var_1_9)) && (var_1_8 == 0)) && (((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_14) == (var_1_10 + (4294967296 * (((4294967295 * var_1_13) + var_1_14) / 4294967296)))))) RESULT: Ultimate proved your program to be correct! [2023-11-29 04:44:06,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4581e89-fe9b-43b3-9a13-c8e28e8d394c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE