./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd --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 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:50:23,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:50:24,092 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:50:24,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:50:24,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:50:24,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:50:24,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:50:24,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:50:24,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:50:24,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:50:24,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:50:24,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:50:24,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:50:24,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:50:24,140 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:50:24,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:50:24,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:50:24,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:50:24,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:50:24,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:50:24,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:50:24,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:50:24,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:50:24,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:50:24,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:50:24,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:50:24,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:50:24,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:50:24,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:50:24,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:50:24,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:50:24,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:50:24,146 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd 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 -> 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 [2024-11-13 14:50:24,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:50:24,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:50:24,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:50:24,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:50:24,513 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:50:24,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i Unable to find full path for "g++" [2024-11-13 14:50:26,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:50:27,125 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:50:27,131 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-11-13 14:50:27,146 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/data/83fa29a37/e5ddb00ee1124ef7aa3b62ff1257d8b3/FLAGb41ec39a4 [2024-11-13 14:50:27,174 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/data/83fa29a37/e5ddb00ee1124ef7aa3b62ff1257d8b3 [2024-11-13 14:50:27,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:50:27,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:50:27,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:50:27,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:50:27,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:50:27,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72499d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27, skipping insertion in model container [2024-11-13 14:50:27,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:50:27,446 WARN L250 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_484e64d8-a323-4446-bdaf-b971d9129a42/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i[919,932] [2024-11-13 14:50:27,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:50:27,584 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:50:27,601 WARN L250 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_484e64d8-a323-4446-bdaf-b971d9129a42/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i[919,932] [2024-11-13 14:50:27,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:50:27,672 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:50:27,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27 WrapperNode [2024-11-13 14:50:27,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:50:27,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:50:27,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:50:27,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:50:27,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,766 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-13 14:50:27,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:50:27,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:50:27,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:50:27,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:50:27,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,818 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]. [2024-11-13 14:50:27,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:50:27,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:50:27,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:50:27,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:50:27,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (1/1) ... [2024-11-13 14:50:27,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:50:27,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:50:27,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:50:27,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:50:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:50:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:50:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:50:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:50:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:50:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:50:28,054 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:50:28,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:50:28,577 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 14:50:28,577 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:50:28,593 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:50:28,594 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:50:28,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:50:28 BoogieIcfgContainer [2024-11-13 14:50:28,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:50:28,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:50:28,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:50:28,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:50:28,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:50:27" (1/3) ... [2024-11-13 14:50:28,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d4f2e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:50:28, skipping insertion in model container [2024-11-13 14:50:28,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:27" (2/3) ... [2024-11-13 14:50:28,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d4f2e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:50:28, skipping insertion in model container [2024-11-13 14:50:28,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:50:28" (3/3) ... [2024-11-13 14:50:28,609 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-48.i [2024-11-13 14:50:28,627 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:50:28,629 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-48.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:50:28,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:50:28,732 INFO L333 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, 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;@2f0aa027, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:50:28,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:50:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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) [2024-11-13 14:50:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 14:50:28,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:28,759 INFO L215 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] [2024-11-13 14:50:28,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:28,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash 208156370, now seen corresponding path program 1 times [2024-11-13 14:50:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:50:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842542345] [2024-11-13 14:50:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:50:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:50:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:50:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:50:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:50:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 14:50:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:50:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 14:50:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 14:50:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 14:50:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:50:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:50:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:50:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 14:50:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 14:50:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:50:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:50:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:50:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:50:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 14:50:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:50:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:50:29,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:50:29,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842542345] [2024-11-13 14:50:29,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842542345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:29,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:29,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:50:29,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377239161] [2024-11-13 14:50:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:29,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:50:29,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:50:29,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:50:29,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:50:29,742 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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) [2024-11-13 14:50:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:29,873 INFO L93 Difference]: Finished difference Result 134 states and 233 transitions. [2024-11-13 14:50:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:50:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 [2024-11-13 14:50:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:29,891 INFO L225 Difference]: With dead ends: 134 [2024-11-13 14:50:29,892 INFO L226 Difference]: Without dead ends: 74 [2024-11-13 14:50:29,898 INFO L431 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 [2024-11-13 14:50:29,906 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 18 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:29,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 163 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:50:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-13 14:50:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2024-11-13 14:50:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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) [2024-11-13 14:50:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-13 14:50:29,970 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 127 [2024-11-13 14:50:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:29,975 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-13 14:50:29,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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) [2024-11-13 14:50:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-13 14:50:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 14:50:29,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:29,982 INFO L215 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] [2024-11-13 14:50:29,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:50:29,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:29,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash 265414672, now seen corresponding path program 1 times [2024-11-13 14:50:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:50:29,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290468616] [2024-11-13 14:50:29,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:29,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:50:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:50:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:50:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:50:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:50:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 14:50:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:50:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 14:50:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 14:50:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 14:50:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:50:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:50:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 14:50:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 14:50:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 14:50:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:50:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 14:50:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 14:50:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:50:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 14:50:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:50:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:50:30,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:50:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290468616] [2024-11-13 14:50:30,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290468616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:30,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:30,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:50:30,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193321840] [2024-11-13 14:50:30,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:30,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:50:30,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:50:30,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:50:30,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:50:30,718 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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) [2024-11-13 14:50:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:30,809 INFO L93 Difference]: Finished difference Result 183 states and 279 transitions. [2024-11-13 14:50:30,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:50:30,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 [2024-11-13 14:50:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:30,813 INFO L225 Difference]: With dead ends: 183 [2024-11-13 14:50:30,817 INFO L226 Difference]: Without dead ends: 123 [2024-11-13 14:50:30,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:50:30,819 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:30,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 162 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:50:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-13 14:50:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-11-13 14:50:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 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) [2024-11-13 14:50:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2024-11-13 14:50:30,883 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 127 [2024-11-13 14:50:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:30,887 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2024-11-13 14:50:30,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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) [2024-11-13 14:50:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2024-11-13 14:50:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:50:30,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:30,891 INFO L215 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] [2024-11-13 14:50:30,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:50:30,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:30,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:30,894 INFO L85 PathProgramCache]: Analyzing trace with hash -306730902, now seen corresponding path program 1 times [2024-11-13 14:50:30,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:50:30,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548556968] [2024-11-13 14:50:30,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:50:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:50:31,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:50:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:50:31,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:50:31,394 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:50:31,395 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:50:31,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:50:31,401 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 14:50:31,492 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:50:31,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:50:31 BoogieIcfgContainer [2024-11-13 14:50:31,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:50:31,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:50:31,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:50:31,500 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:50:31,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:50:28" (3/4) ... [2024-11-13 14:50:31,503 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:50:31,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:50:31,505 INFO L158 Benchmark]: Toolchain (without parser) took 4325.23ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 64.5MB in the end (delta: 29.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-11-13 14:50:31,505 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:50:31,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.54ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 79.4MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:50:31,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.40ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 76.3MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:50:31,506 INFO L158 Benchmark]: Boogie Preprocessor took 78.35ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 71.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:50:31,506 INFO L158 Benchmark]: RCFGBuilder took 744.99ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 52.5MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:50:31,506 INFO L158 Benchmark]: TraceAbstraction took 2899.05ms. Allocated memory is still 117.4MB. Free memory was 51.8MB in the beginning and 64.5MB in the end (delta: -12.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:50:31,507 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 64.5MB in the end (delta: 18.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:50:31,509 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.54ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 79.4MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.40ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 76.3MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.35ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 71.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 744.99ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 52.5MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2899.05ms. Allocated memory is still 117.4MB. Free memory was 51.8MB in the beginning and 64.5MB in the end (delta: -12.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 64.5MB in the end (delta: 18.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned char last_1_var_1_8 = 5; [L41] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L131] last_1_var_1_8 = var_1_8 [L132] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L142] RET updateLastVariables() [L143] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L98] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L99] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L99] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] var_1_3 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] var_1_4 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] var_1_5 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] var_1_6 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] var_1_7 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L110] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L110] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L111] var_1_9 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L112] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L113] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L113] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L114] var_1_10 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L115] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L116] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L116] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L117] var_1_11 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L118] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L119] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L119] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L120] var_1_15 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L121] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L122] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L122] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L123] var_1_16 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L124] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L125] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L125] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L126] var_1_17 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L127] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L128] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L128] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L143] RET updateVariables() [L144] CALL step() [L45] COND FALSE !(\read(var_1_2)) [L54] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L56] COND TRUE var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12))) [L57] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L61] COND FALSE !(\read(var_1_2)) [L68] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=5] [L70] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L71] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L79] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L82] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L85] COND FALSE !(last_1_var_1_18 != var_1_16) [L92] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 170 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1520/1520 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 [2024-11-13 14:50:31,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd --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 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:50:34,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:50:34,475 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:50:34,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:50:34,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:50:34,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:50:34,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:50:34,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:50:34,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:50:34,522 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:50:34,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:50:34,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:50:34,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:50:34,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:50:34,523 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:50:34,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:50:34,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:50:34,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:50:34,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:50:34,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:50:34,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:50:34,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:50:34,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:50:34,534 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:50:34,534 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:50:34,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:50:34,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:50:34,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:50:34,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:50:34,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:50:34,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:50:34,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:50:34,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:50:34,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:50:34,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:50:34,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:50:34,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:50:34,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:50:34,535 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:50:34,535 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:50:34,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:50:34,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:50:34,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:50:34,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:50:34,536 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd 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 -> 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 [2024-11-13 14:50:34,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:50:34,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:50:34,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:50:34,877 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:50:34,877 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:50:34,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i Unable to find full path for "g++" [2024-11-13 14:50:36,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:50:37,195 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:50:37,196 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-11-13 14:50:37,212 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/data/612b94d48/1c2924de5bb74d44b8d3e36a15217816/FLAGec7300803 [2024-11-13 14:50:37,237 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/data/612b94d48/1c2924de5bb74d44b8d3e36a15217816 [2024-11-13 14:50:37,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:50:37,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:50:37,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:50:37,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:50:37,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:50:37,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11166fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37, skipping insertion in model container [2024-11-13 14:50:37,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:50:37,451 WARN L250 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_484e64d8-a323-4446-bdaf-b971d9129a42/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i[919,932] [2024-11-13 14:50:37,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:50:37,565 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:50:37,575 WARN L250 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_484e64d8-a323-4446-bdaf-b971d9129a42/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i[919,932] [2024-11-13 14:50:37,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:50:37,626 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:50:37,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37 WrapperNode [2024-11-13 14:50:37,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:50:37,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:50:37,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:50:37,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:50:37,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,672 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-13 14:50:37,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:50:37,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:50:37,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:50:37,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:50:37,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,711 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]. [2024-11-13 14:50:37,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:50:37,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:50:37,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:50:37,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:50:37,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (1/1) ... [2024-11-13 14:50:37,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:50:37,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:50:37,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:50:37,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:50:37,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:50:37,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:50:37,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:50:37,826 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:50:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:50:37,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:50:37,937 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:50:37,939 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:51:03,792 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 14:51:03,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:51:03,802 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:51:03,802 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:51:03,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:51:03 BoogieIcfgContainer [2024-11-13 14:51:03,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:51:03,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:51:03,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:51:03,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:51:03,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:50:37" (1/3) ... [2024-11-13 14:51:03,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ae0750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:51:03, skipping insertion in model container [2024-11-13 14:51:03,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:37" (2/3) ... [2024-11-13 14:51:03,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ae0750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:51:03, skipping insertion in model container [2024-11-13 14:51:03,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:51:03" (3/3) ... [2024-11-13 14:51:03,812 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-48.i [2024-11-13 14:51:03,827 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:51:03,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-48.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:51:03,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:51:03,893 INFO L333 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, 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;@448db7c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:51:03,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:51:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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) [2024-11-13 14:51:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 14:51:03,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:03,908 INFO L215 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] [2024-11-13 14:51:03,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:03,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash 208156370, now seen corresponding path program 1 times [2024-11-13 14:51:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:03,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278302242] [2024-11-13 14:51:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:03,926 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 [2024-11-13 14:51:03,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:03,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 14:51:03,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 14:51:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:05,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:51:05,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:51:06,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:06,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278302242] [2024-11-13 14:51:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278302242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:06,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:06,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:51:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510225036] [2024-11-13 14:51:06,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:06,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:51:06,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:06,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:51:06,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:51:06,155 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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) [2024-11-13 14:51:10,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:15,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:15,556 INFO L93 Difference]: Finished difference Result 134 states and 233 transitions. [2024-11-13 14:51:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:51:15,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 [2024-11-13 14:51:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:15,567 INFO L225 Difference]: With dead ends: 134 [2024-11-13 14:51:15,568 INFO L226 Difference]: Without dead ends: 74 [2024-11-13 14:51:15,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:51:15,573 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:15,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 163 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-11-13 14:51:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-13 14:51:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2024-11-13 14:51:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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) [2024-11-13 14:51:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-13 14:51:15,630 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 127 [2024-11-13 14:51:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:15,633 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-13 14:51:15,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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) [2024-11-13 14:51:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-13 14:51:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 14:51:15,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:15,636 INFO L215 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] [2024-11-13 14:51:15,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 14:51:15,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 14:51:15,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:15,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash 265414672, now seen corresponding path program 1 times [2024-11-13 14:51:15,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:15,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626212373] [2024-11-13 14:51:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:15,839 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 [2024-11-13 14:51:15,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:15,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 14:51:15,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 14:51:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:17,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:51:17,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:51:21,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:21,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626212373] [2024-11-13 14:51:21,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626212373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:21,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:21,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:51:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776018939] [2024-11-13 14:51:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:21,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:51:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:21,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:51:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:51:21,339 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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) [2024-11-13 14:51:25,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:30,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:30,533 INFO L93 Difference]: Finished difference Result 183 states and 279 transitions. [2024-11-13 14:51:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:51:30,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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 [2024-11-13 14:51:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:30,537 INFO L225 Difference]: With dead ends: 183 [2024-11-13 14:51:30,537 INFO L226 Difference]: Without dead ends: 123 [2024-11-13 14:51:30,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:51:30,539 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:30,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 163 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2024-11-13 14:51:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-13 14:51:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-11-13 14:51:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 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) [2024-11-13 14:51:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2024-11-13 14:51:30,576 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 127 [2024-11-13 14:51:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:30,577 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2024-11-13 14:51:30,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 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) [2024-11-13 14:51:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2024-11-13 14:51:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:51:30,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:30,580 INFO L215 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] [2024-11-13 14:51:30,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 14:51:30,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 14:51:30,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:30,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -306730902, now seen corresponding path program 1 times [2024-11-13 14:51:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:30,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218387413] [2024-11-13 14:51:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:30,782 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 [2024-11-13 14:51:30,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:30,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 14:51:30,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_484e64d8-a323-4446-bdaf-b971d9129a42/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 14:51:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:32,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:51:32,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:46,407 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:51:54,882 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:52:03,015 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:52:11,493 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:52:18,934 WARN L286 SmtUtils]: Spent 7.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:52:31,882 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:52:40,834 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:52:49,311 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:52:57,841 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:53:06,325 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:53:14,931 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:53:23,404 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:53:31,916 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:53:40,418 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:53:48,935 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:53:57,389 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:01,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (and (let ((.cse1 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse0 (bvslt .cse1 (_ bv0 32)))) (or (and (not .cse0) (= ((_ extract 7 0) .cse1) c_~var_1_14~0)) (and .cse0 (= ((_ extract 7 0) (bvneg .cse1)) c_~var_1_14~0))))) (let ((.cse4 (bvadd (bvneg ((_ zero_extend 24) c_~var_1_16~0)) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse3 (bvsgt .cse4 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse2) (not .cse3)) (and .cse3 (= .cse4 .cse2))))) (= ((_ extract 7 0) .cse2) c_~var_1_8~0) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse5 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse5) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse5))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)))) is different from false [2024-11-13 14:54:05,666 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (and (let ((.cse1 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse0 (bvslt .cse1 (_ bv0 32)))) (or (and (not .cse0) (= ((_ extract 7 0) .cse1) c_~var_1_14~0)) (and .cse0 (= ((_ extract 7 0) (bvneg .cse1)) c_~var_1_14~0))))) (let ((.cse4 (bvadd (bvneg ((_ zero_extend 24) c_~var_1_16~0)) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse3 (bvsgt .cse4 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse2) (not .cse3)) (and .cse3 (= .cse4 .cse2))))) (= ((_ extract 7 0) .cse2) c_~var_1_8~0) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse5 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse5) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse5))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)))) is different from true [2024-11-13 14:54:14,254 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:22,721 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:30,853 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:39,301 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:47,440 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:55,904 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:04,473 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:12,933 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:21,445 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:29,937 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:38,441 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:46,918 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:55,396 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:56:03,879 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:56:12,354 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:56:20,832 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:56:29,303 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:56:33,449 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (and (let ((.cse1 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse0 (bvslt .cse1 (_ bv0 32)))) (or (and (not .cse0) (= ((_ extract 7 0) .cse1) c_~var_1_14~0)) (and .cse0 (= ((_ extract 7 0) (bvneg .cse1)) c_~var_1_14~0))))) (let ((.cse4 (bvadd (bvneg ((_ zero_extend 24) c_~var_1_16~0)) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse3 (bvsgt .cse4 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse2) (not .cse3)) (and .cse3 (= .cse4 .cse2))))) (= ((_ extract 7 0) .cse2) c_~var_1_8~0) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse5 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse5) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse5))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)) (= (_ bv0 8) c_~var_1_2~0))) is different from false [2024-11-13 14:56:37,588 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (and (let ((.cse1 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse0 (bvslt .cse1 (_ bv0 32)))) (or (and (not .cse0) (= ((_ extract 7 0) .cse1) c_~var_1_14~0)) (and .cse0 (= ((_ extract 7 0) (bvneg .cse1)) c_~var_1_14~0))))) (let ((.cse4 (bvadd (bvneg ((_ zero_extend 24) c_~var_1_16~0)) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse3 (bvsgt .cse4 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse2) (not .cse3)) (and .cse3 (= .cse4 .cse2))))) (= ((_ extract 7 0) .cse2) c_~var_1_8~0) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse5 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse5) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse5))) (= ((_ zero_extend 16) c_~last_1_var_1_18~0) c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)) (= (_ bv0 8) c_~var_1_2~0))) is different from true [2024-11-13 14:56:46,122 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:56:54,575 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:57:02,717 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:57:11,204 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:57:19,363 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:57:27,820 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:57:36,314 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:57:44,773 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:57:53,473 WARN L286 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:58:02,058 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:58:10,672 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:58:19,245 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:58:27,831 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:58:36,366 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:58:44,864 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:58:53,459 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:59:02,019 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:59:10,582 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:59:19,139 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:59:27,743 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:59:34,603 WARN L286 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:59:43,103 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:59:57,126 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:00:05,648 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:00:14,269 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:00:22,812 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:00:31,321 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:00:39,939 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:00:48,467 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:00:56,961 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:01:05,534 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:01:14,010 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:01:22,517 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:01:30,992 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:01:35,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) c_~var_1_16~0)) (.cse4 ((_ zero_extend 24) c_~var_1_10~0)) (.cse1 ((_ zero_extend 16) c_~last_1_var_1_18~0))) (and (= .cse0 .cse1) (let ((.cse3 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse2 (bvslt .cse3 (_ bv0 32)))) (or (and (not .cse2) (= ((_ extract 7 0) .cse3) c_~var_1_14~0)) (and .cse2 (= ((_ extract 7 0) (bvneg .cse3)) c_~var_1_14~0))))) (let ((.cse6 (bvadd (bvneg .cse0) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse5 (bvsgt .cse6 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse4) (not .cse5)) (and .cse5 (= .cse6 .cse4))))) (= ((_ extract 7 0) .cse4) c_~var_1_8~0) (= c_~var_1_18~0 ((_ zero_extend 8) c_~var_1_10~0)) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse7 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse7) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse7))) (= .cse1 c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)) (= (_ bv0 8) c_~var_1_2~0))) is different from false [2024-11-13 15:01:39,289 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) c_~var_1_16~0)) (.cse4 ((_ zero_extend 24) c_~var_1_10~0)) (.cse1 ((_ zero_extend 16) c_~last_1_var_1_18~0))) (and (= .cse0 .cse1) (let ((.cse3 ((_ sign_extend 24) c_~var_1_17~0))) (let ((.cse2 (bvslt .cse3 (_ bv0 32)))) (or (and (not .cse2) (= ((_ extract 7 0) .cse3) c_~var_1_14~0)) (and .cse2 (= ((_ extract 7 0) (bvneg .cse3)) c_~var_1_14~0))))) (let ((.cse6 (bvadd (bvneg .cse0) ((_ zero_extend 24) c_~var_1_15~0)))) (let ((.cse5 (bvsgt .cse6 c_~var_1_12~0))) (or (and (= c_~var_1_12~0 .cse4) (not .cse5)) (and .cse5 (= .cse6 .cse4))))) (= ((_ extract 7 0) .cse4) c_~var_1_8~0) (= c_~var_1_18~0 ((_ zero_extend 8) c_~var_1_10~0)) (= (_ bv256 32) c_~var_1_13~0) (let ((.cse7 (fp.gt c_~var_1_3~0 c_~var_1_9~0))) (or (and (not .cse7) (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_9~0))) (and (fp.gt c_~var_1_6~0 (fp.div c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0)) .cse7))) (= .cse1 c_~var_1_12~0) (= c_~var_1_1~0 (_ bv1 16)) (= (_ bv0 8) c_~var_1_2~0))) is different from true