./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.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_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme --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 66742a05478e72848fd648f016327ac79a7e42b57738bfdecbd0eee20f5e634e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:00:34,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:00:34,679 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:00:34,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:00:34,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:00:34,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:00:34,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:00:34,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:00:34,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:00:34,741 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:00:34,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:00:34,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:00:34,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:00:34,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:00:34,746 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:00:34,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:00:34,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:00:34,748 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:00:34,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:00:34,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:00:34,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:00:34,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:00:34,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:00:34,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:00:34,751 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:00:34,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:00:34,752 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:00:34,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:00:34,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:00:34,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:00:34,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:00:34,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:00:34,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:00:34,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:00:34,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:00:34,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:00:34,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:00:34,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:00:34,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:00:34,757 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:00:34,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:00:34,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:00:34,758 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_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/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_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme 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 -> 66742a05478e72848fd648f016327ac79a7e42b57738bfdecbd0eee20f5e634e [2023-11-26 12:00:35,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:00:35,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:00:35,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:00:35,184 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:00:35,184 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:00:35,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2023-11-26 12:00:38,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:00:38,702 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:00:38,703 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2023-11-26 12:00:38,716 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/data/3db0b802c/3ee36054519144bb9f859a2a215f88c9/FLAG9794ed07c [2023-11-26 12:00:38,732 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/data/3db0b802c/3ee36054519144bb9f859a2a215f88c9 [2023-11-26 12:00:38,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:00:38,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:00:38,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:38,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:00:38,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:00:38,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:38" (1/1) ... [2023-11-26 12:00:38,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a39ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:38, skipping insertion in model container [2023-11-26 12:00:38,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:38" (1/1) ... [2023-11-26 12:00:38,800 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:00:38,937 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_4e13a277-8633-4c98-955a-b695758ba104/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i[919,932] [2023-11-26 12:00:38,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:39,004 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:00:39,017 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_4e13a277-8633-4c98-955a-b695758ba104/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i[919,932] [2023-11-26 12:00:39,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:39,066 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:00:39,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39 WrapperNode [2023-11-26 12:00:39,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:39,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:39,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:00:39,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:00:39,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,126 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2023-11-26 12:00:39,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:39,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:00:39,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:00:39,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:00:39,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,162 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-26 12:00:39,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:00:39,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:00:39,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:00:39,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:00:39,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (1/1) ... [2023-11-26 12:00:39,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:00:39,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:00:39,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:00:39,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:00:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:00:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 12:00:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 12:00:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:00:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:00:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:00:39,433 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:00:39,435 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:00:39,872 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:00:39,952 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:00:39,952 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:00:39,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:39 BoogieIcfgContainer [2023-11-26 12:00:39,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:00:39,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:00:39,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:00:39,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:00:39,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:00:38" (1/3) ... [2023-11-26 12:00:39,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a72f8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:39, skipping insertion in model container [2023-11-26 12:00:39,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:39" (2/3) ... [2023-11-26 12:00:39,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a72f8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:39, skipping insertion in model container [2023-11-26 12:00:39,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:39" (3/3) ... [2023-11-26 12:00:39,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-27.i [2023-11-26 12:00:39,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:00:39,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:00:40,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:00:40,062 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;@26ccbc85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:00:40,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:00:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 12:00:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-26 12:00:40,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:40,093 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:40,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:40,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:40,101 INFO L85 PathProgramCache]: Analyzing trace with hash 96445642, now seen corresponding path program 1 times [2023-11-26 12:00:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:40,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566738370] [2023-11-26 12:00:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:00:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:00:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:00:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:00:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 12:00:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-26 12:00:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 12:00:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-26 12:00:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:00:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 12:00:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-26 12:00:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-26 12:00:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 12:00:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 12:00:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-26 12:00:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-26 12:00:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-26 12:00:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 12:00:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566738370] [2023-11-26 12:00:40,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566738370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:40,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:40,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607346894] [2023-11-26 12:00:40,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:40,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:00:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:40,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:00:40,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:00:40,639 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-26 12:00:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:40,708 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2023-11-26 12:00:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:00:40,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2023-11-26 12:00:40,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:40,721 INFO L225 Difference]: With dead ends: 119 [2023-11-26 12:00:40,722 INFO L226 Difference]: Without dead ends: 59 [2023-11-26 12:00:40,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-26 12:00:40,731 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:40,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:00:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-26 12:00:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-26 12:00:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 12:00:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2023-11-26 12:00:40,799 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 126 [2023-11-26 12:00:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:40,800 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2023-11-26 12:00:40,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-26 12:00:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2023-11-26 12:00:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-26 12:00:40,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:40,812 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:40,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:00:40,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:40,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash -501764414, now seen corresponding path program 1 times [2023-11-26 12:00:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964817247] [2023-11-26 12:00:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:00:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:00:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:00:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:00:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 12:00:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-26 12:00:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 12:00:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-26 12:00:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:00:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 12:00:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-26 12:00:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-26 12:00:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 12:00:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 12:00:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-26 12:00:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-26 12:00:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-26 12:00:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 12:00:41,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964817247] [2023-11-26 12:00:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964817247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:41,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:00:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774687220] [2023-11-26 12:00:41,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:41,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:41,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:41,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:41,465 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:00:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:41,528 INFO L93 Difference]: Finished difference Result 175 states and 271 transitions. [2023-11-26 12:00:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:41,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2023-11-26 12:00:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:41,532 INFO L225 Difference]: With dead ends: 175 [2023-11-26 12:00:41,532 INFO L226 Difference]: Without dead ends: 117 [2023-11-26 12:00:41,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-26 12:00:41,535 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 47 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:41,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 165 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:00:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-26 12:00:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2023-11-26 12:00:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-26 12:00:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 174 transitions. [2023-11-26 12:00:41,583 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 174 transitions. Word has length 126 [2023-11-26 12:00:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:41,600 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 174 transitions. [2023-11-26 12:00:41,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:00:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 174 transitions. [2023-11-26 12:00:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-26 12:00:41,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:41,603 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:41,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:00:41,603 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:41,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash 232534288, now seen corresponding path program 1 times [2023-11-26 12:00:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312803693] [2023-11-26 12:00:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:00:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:00:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:00:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:00:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 12:00:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-26 12:00:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 12:00:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-26 12:00:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:00:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 12:00:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-26 12:00:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-26 12:00:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 12:00:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 12:00:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-26 12:00:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-26 12:00:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:41,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-26 12:00:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 12:00:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:42,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312803693] [2023-11-26 12:00:42,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312803693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:42,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:42,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:00:42,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214397848] [2023-11-26 12:00:42,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:42,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:00:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:42,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:00:42,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:00:42,015 INFO L87 Difference]: Start difference. First operand 113 states and 174 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:00:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:42,181 INFO L93 Difference]: Finished difference Result 227 states and 351 transitions. [2023-11-26 12:00:42,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:00:42,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-11-26 12:00:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:42,184 INFO L225 Difference]: With dead ends: 227 [2023-11-26 12:00:42,184 INFO L226 Difference]: Without dead ends: 115 [2023-11-26 12:00:42,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:00:42,187 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 89 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:42,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:00:42,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-26 12:00:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-26 12:00:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-26 12:00:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2023-11-26 12:00:42,211 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 127 [2023-11-26 12:00:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:42,212 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2023-11-26 12:00:42,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:00:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2023-11-26 12:00:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-26 12:00:42,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:42,215 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:42,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:00:42,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:42,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash 933598866, now seen corresponding path program 1 times [2023-11-26 12:00:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654693993] [2023-11-26 12:00:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:00:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:00:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:00:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:00:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:00:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 12:00:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-26 12:00:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 12:00:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-26 12:00:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:00:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 12:00:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-26 12:00:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-26 12:00:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 12:00:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 12:00:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 12:00:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 12:00:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-26 12:00:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-26 12:00:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-26 12:00:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 12:00:42,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:42,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654693993] [2023-11-26 12:00:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654693993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:42,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:42,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:00:42,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109979384] [2023-11-26 12:00:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:42,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:00:42,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:00:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:00:42,614 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:00:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:00:42,786 INFO L93 Difference]: Finished difference Result 229 states and 351 transitions. [2023-11-26 12:00:42,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:00:42,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-11-26 12:00:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:00:42,791 INFO L225 Difference]: With dead ends: 229 [2023-11-26 12:00:42,792 INFO L226 Difference]: Without dead ends: 115 [2023-11-26 12:00:42,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:00:42,804 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 88 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:00:42,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:00:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-26 12:00:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2023-11-26 12:00:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-26 12:00:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2023-11-26 12:00:42,845 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 127 [2023-11-26 12:00:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:00:42,847 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2023-11-26 12:00:42,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:00:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2023-11-26 12:00:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 12:00:42,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:42,853 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:42,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:00:42,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:42,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1803996711, now seen corresponding path program 1 times [2023-11-26 12:00:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168619928] [2023-11-26 12:00:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:00:42,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:00:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:00:43,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:00:43,121 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:00:43,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 12:00:43,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:00:43,127 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-26 12:00:43,131 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:00:43,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 12:00:43,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-26 12:00:43,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:00:43 BoogieIcfgContainer [2023-11-26 12:00:43,238 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:00:43,239 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:00:43,239 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:00:43,239 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:00:43,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:39" (3/4) ... [2023-11-26 12:00:43,241 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:00:43,242 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:00:43,243 INFO L158 Benchmark]: Toolchain (without parser) took 4502.97ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 133.9MB in the beginning and 77.9MB in the end (delta: 56.0MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2023-11-26 12:00:43,243 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:00:43,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.60ms. Allocated memory is still 163.6MB. Free memory was 133.5MB in the beginning and 120.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 12:00:43,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.05ms. Allocated memory is still 163.6MB. Free memory was 120.1MB in the beginning and 117.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:00:43,244 INFO L158 Benchmark]: Boogie Preprocessor took 89.78ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 113.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:00:43,245 INFO L158 Benchmark]: RCFGBuilder took 733.94ms. Allocated memory is still 163.6MB. Free memory was 113.3MB in the beginning and 91.9MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 12:00:43,245 INFO L158 Benchmark]: TraceAbstraction took 3281.43ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 91.1MB in the beginning and 77.9MB in the end (delta: 13.3MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2023-11-26 12:00:43,245 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 197.1MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:00:43,247 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.29ms. Allocated memory is still 121.6MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.60ms. Allocated memory is still 163.6MB. Free memory was 133.5MB in the beginning and 120.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.05ms. Allocated memory is still 163.6MB. Free memory was 120.1MB in the beginning and 117.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.78ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 113.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 733.94ms. Allocated memory is still 163.6MB. Free memory was 113.3MB in the beginning and 91.9MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3281.43ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 91.1MB in the beginning and 77.9MB in the end (delta: 13.3MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 197.1MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] FCALL updateLastVariables() [L131] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L89] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L89] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L92] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L92] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L93] var_1_4 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L94] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L95] var_1_5 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L96] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L97] var_1_6 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1] [L98] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L100] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L101] var_1_11 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L103] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L104] var_1_13 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L105] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L106] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L106] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L107] var_1_15 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L108] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L109] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L109] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L111] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L112] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L112] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L113] var_1_17 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L114] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L115] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L115] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L116] var_1_19 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L117] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L118] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L118] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L131] RET updateVariables() [L132] CALL step() [L45] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L46] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L48] var_1_20 = var_1_11 [L49] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L50] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L50] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L51] COND TRUE var_1_12 != var_1_21 [L52] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L57] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L68] COND TRUE var_1_14 || var_1_14 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L69] COND TRUE var_1_14 || var_1_14 [L70] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L77] COND FALSE !(var_1_6 > (- var_1_7)) [L82] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=0] [L84] var_1_22 = var_1_8 [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=0] [L123-L124] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 484 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 332 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 12:00:43,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme --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 66742a05478e72848fd648f016327ac79a7e42b57738bfdecbd0eee20f5e634e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:00:46,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:00:46,182 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 12:00:46,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:00:46,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:00:46,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:00:46,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:00:46,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:00:46,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:00:46,248 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:00:46,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:00:46,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:00:46,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:00:46,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:00:46,253 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:00:46,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:00:46,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:00:46,255 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:00:46,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:00:46,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:00:46,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:00:46,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:00:46,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:00:46,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:00:46,259 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 12:00:46,259 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 12:00:46,260 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:00:46,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:00:46,261 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:00:46,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:00:46,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:00:46,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:00:46,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:00:46,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:00:46,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:00:46,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:00:46,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:00:46,266 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 12:00:46,266 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 12:00:46,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:00:46,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:00:46,267 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:00:46,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:00:46,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:00:46,268 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 12:00:46,268 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_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/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_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme 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 -> 66742a05478e72848fd648f016327ac79a7e42b57738bfdecbd0eee20f5e634e [2023-11-26 12:00:46,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:00:46,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:00:46,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:00:46,705 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:00:46,706 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:00:46,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2023-11-26 12:00:49,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:00:50,155 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:00:50,155 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2023-11-26 12:00:50,166 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/data/8c2875b42/4963126e06da4c0b860ae7ac9597d597/FLAG6a89f37f0 [2023-11-26 12:00:50,183 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/data/8c2875b42/4963126e06da4c0b860ae7ac9597d597 [2023-11-26 12:00:50,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:00:50,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:00:50,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:50,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:00:50,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:00:50,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13453290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50, skipping insertion in model container [2023-11-26 12:00:50,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,231 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:00:50,431 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_4e13a277-8633-4c98-955a-b695758ba104/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i[919,932] [2023-11-26 12:00:50,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:50,556 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:00:50,582 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_4e13a277-8633-4c98-955a-b695758ba104/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i[919,932] [2023-11-26 12:00:50,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:50,664 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:00:50,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50 WrapperNode [2023-11-26 12:00:50,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:50,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:50,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:00:50,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:00:50,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,753 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2023-11-26 12:00:50,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:50,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:00:50,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:00:50,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:00:50,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,806 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-26 12:00:50,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:00:50,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:00:50,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:00:50,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:00:50,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (1/1) ... [2023-11-26 12:00:50,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:00:50,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:00:50,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:00:50,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:00:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:00:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 12:00:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 12:00:50,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 12:00:50,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:00:50,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:00:51,051 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:00:51,054 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:00:58,282 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:00:58,352 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:00:58,353 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:00:58,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:58 BoogieIcfgContainer [2023-11-26 12:00:58,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:00:58,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:00:58,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:00:58,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:00:58,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:00:50" (1/3) ... [2023-11-26 12:00:58,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa14b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:58, skipping insertion in model container [2023-11-26 12:00:58,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:50" (2/3) ... [2023-11-26 12:00:58,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa14b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:58, skipping insertion in model container [2023-11-26 12:00:58,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:58" (3/3) ... [2023-11-26 12:00:58,363 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-27.i [2023-11-26 12:00:58,381 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:00:58,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:00:58,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:00:58,444 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;@2f550805, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:00:58,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:00:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 12:00:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-26 12:00:58,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:00:58,466 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:58,466 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:00:58,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash -632538109, now seen corresponding path program 1 times [2023-11-26 12:00:58,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:00:58,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566135077] [2023-11-26 12:00:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:58,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:00:58,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:00:58,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:00:58,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 12:00:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:59,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 12:00:59,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:00:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2023-11-26 12:00:59,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:00:59,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:00:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566135077] [2023-11-26 12:00:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566135077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:59,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:59,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561751844] [2023-11-26 12:00:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:59,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:00:59,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:00:59,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:00:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:00:59,392 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-26 12:01:01,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 12:01:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:01,744 INFO L93 Difference]: Finished difference Result 109 states and 194 transitions. [2023-11-26 12:01:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:01:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2023-11-26 12:01:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:01,795 INFO L225 Difference]: With dead ends: 109 [2023-11-26 12:01:01,795 INFO L226 Difference]: Without dead ends: 54 [2023-11-26 12:01:01,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-26 12:01:01,802 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:01,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-26 12:01:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-26 12:01:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-26 12:01:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 12:01:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2023-11-26 12:01:01,866 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 123 [2023-11-26 12:01:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:01,867 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2023-11-26 12:01:01,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-26 12:01:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2023-11-26 12:01:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-26 12:01:01,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:01,875 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:01,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-26 12:01:02,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:01:02,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:02,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash -509004533, now seen corresponding path program 1 times [2023-11-26 12:01:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:01:02,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042909829] [2023-11-26 12:01:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:02,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:01:02,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:01:02,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:01:02,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 12:01:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:02,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 12:01:02,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:01:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2023-11-26 12:01:03,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:01:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 12:01:03,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:01:03,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042909829] [2023-11-26 12:01:03,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042909829] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-26 12:01:03,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 12:01:03,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-26 12:01:03,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605340147] [2023-11-26 12:01:03,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:03,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:01:03,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:03,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:01:03,334 INFO L87 Difference]: Start difference. First operand 54 states and 83 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:01:08,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 12:01:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:08,480 INFO L93 Difference]: Finished difference Result 111 states and 168 transitions. [2023-11-26 12:01:08,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:08,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2023-11-26 12:01:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:08,529 INFO L225 Difference]: With dead ends: 111 [2023-11-26 12:01:08,529 INFO L226 Difference]: Without dead ends: 58 [2023-11-26 12:01:08,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:01:08,532 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 47 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:08,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 106 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-11-26 12:01:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-26 12:01:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-26 12:01:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 12:01:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2023-11-26 12:01:08,550 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 123 [2023-11-26 12:01:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:08,551 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2023-11-26 12:01:08,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:01:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2023-11-26 12:01:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-26 12:01:08,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:08,560 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:08,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 12:01:08,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:01:08,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:08,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1936013970, now seen corresponding path program 1 times [2023-11-26 12:01:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:01:08,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712160509] [2023-11-26 12:01:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:08,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:01:08,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:01:08,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:01:08,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 12:01:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:09,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 12:01:09,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:01:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-26 12:01:10,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:01:10,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:01:10,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712160509] [2023-11-26 12:01:10,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712160509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:10,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:10,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:10,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976047354] [2023-11-26 12:01:10,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:10,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:10,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:01:10,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:10,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:10,126 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:01:14,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 12:01:15,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 12:01:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:01:16,007 INFO L93 Difference]: Finished difference Result 172 states and 253 transitions. [2023-11-26 12:01:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:16,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-26 12:01:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:01:16,013 INFO L225 Difference]: With dead ends: 172 [2023-11-26 12:01:16,014 INFO L226 Difference]: Without dead ends: 115 [2023-11-26 12:01:16,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 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-26 12:01:16,017 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-26 12:01:16,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-11-26 12:01:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-26 12:01:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2023-11-26 12:01:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-26 12:01:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2023-11-26 12:01:16,055 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 124 [2023-11-26 12:01:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:01:16,056 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2023-11-26 12:01:16,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-26 12:01:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2023-11-26 12:01:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-26 12:01:16,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:01:16,060 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:16,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-26 12:01:16,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:01:16,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:01:16,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:16,273 INFO L85 PathProgramCache]: Analyzing trace with hash -360099472, now seen corresponding path program 1 times [2023-11-26 12:01:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:01:16,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808783405] [2023-11-26 12:01:16,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:16,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:01:16,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:01:16,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:01:16,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e13a277-8633-4c98-955a-b695758ba104/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 12:01:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:16,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-26 12:01:16,836 INFO L285 TraceCheckSpWp]: Computing forward predicates...