./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX --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 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:04:16,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:04:17,029 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:04:17,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:04:17,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:04:17,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:04:17,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:04:17,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:04:17,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:04:17,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:04:17,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:04:17,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:04:17,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:04:17,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:04:17,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:04:17,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:04:17,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:04:17,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:04:17,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:04:17,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:04:17,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:04:17,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:04:17,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:04:17,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:04:17,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:04:17,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:04:17,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:04:17,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:04:17,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:04:17,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:04:17,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:04:17,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:04:17,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:04:17,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:04:17,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:04:17,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:04:17,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:04:17,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:04:17,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:04:17,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:04:17,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:04:17,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:04:17,109 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX 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 -> 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 [2024-11-08 16:04:17,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:04:17,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:04:17,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:04:17,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:04:17,418 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:04:17,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i Unable to find full path for "g++" [2024-11-08 16:04:19,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:04:19,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:04:19,692 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-08 16:04:19,702 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/data/bdd10d0af/9075f2b726dd48008ec2505aaac3797f/FLAG5b30049ea [2024-11-08 16:04:19,720 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/data/bdd10d0af/9075f2b726dd48008ec2505aaac3797f [2024-11-08 16:04:19,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:04:19,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:04:19,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:04:19,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:04:19,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:04:19,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:04:19" (1/1) ... [2024-11-08 16:04:19,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae8be7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:19, skipping insertion in model container [2024-11-08 16:04:19,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:04:19" (1/1) ... [2024-11-08 16:04:19,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:04:19,989 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_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-08 16:04:20,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:04:20,096 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:04:20,112 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_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-08 16:04:20,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:04:20,187 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:04:20,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20 WrapperNode [2024-11-08 16:04:20,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:04:20,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:04:20,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:04:20,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:04:20,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,256 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2024-11-08 16:04:20,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:04:20,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:04:20,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:04:20,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:04:20,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,299 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-08 16:04:20,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:04:20,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:04:20,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:04:20,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:04:20,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:04:20,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:20,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:04:20,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:04:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:04:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:04:20,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:04:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:04:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:04:20,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:04:20,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:04:20,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:04:20,951 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 16:04:20,952 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:04:20,971 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:04:20,971 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:04:20,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:20 BoogieIcfgContainer [2024-11-08 16:04:20,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:04:20,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:04:20,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:04:20,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:04:20,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:04:19" (1/3) ... [2024-11-08 16:04:20,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dac4e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:04:20, skipping insertion in model container [2024-11-08 16:04:20,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (2/3) ... [2024-11-08 16:04:20,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dac4e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:04:20, skipping insertion in model container [2024-11-08 16:04:20,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:20" (3/3) ... [2024-11-08 16:04:20,985 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-29.i [2024-11-08 16:04:21,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:04:21,006 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:04:21,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:04:21,105 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;@2c22bfd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:04:21,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:04:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 16:04:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 16:04:21,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:21,138 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:04:21,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:21,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1830954061, now seen corresponding path program 1 times [2024-11-08 16:04:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:21,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217036211] [2024-11-08 16:04:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:04:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:04:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:04:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:04:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:04:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:04:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:04:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:04:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:04:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:04:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:04:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:04:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:04:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:04:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:04:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:04:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:04:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:04:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:04:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:04:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 16:04:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 16:04:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 16:04:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 16:04:21,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:21,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217036211] [2024-11-08 16:04:21,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217036211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:21,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:04:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355815345] [2024-11-08 16:04:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:21,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:04:21,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:21,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:04:21,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:04:21,901 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 16:04:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:21,960 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2024-11-08 16:04:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:04:21,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-11-08 16:04:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:21,974 INFO L225 Difference]: With dead ends: 137 [2024-11-08 16:04:21,975 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 16:04:21,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:04:21,988 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:21,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 16:04:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 16:04:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 16:04:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2024-11-08 16:04:22,076 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 170 [2024-11-08 16:04:22,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:22,077 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2024-11-08 16:04:22,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 16:04:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2024-11-08 16:04:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 16:04:22,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:22,088 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:04:22,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:04:22,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:22,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash 599721199, now seen corresponding path program 1 times [2024-11-08 16:04:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:22,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325948374] [2024-11-08 16:04:22,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:22,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:04:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:04:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:04:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:04:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:04:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:04:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:04:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:04:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:04:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:04:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:04:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:04:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:04:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:04:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:04:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:04:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:04:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:04:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:04:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:04:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 16:04:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 16:04:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 16:04:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 16:04:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:22,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325948374] [2024-11-08 16:04:22,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325948374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:22,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:04:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491544006] [2024-11-08 16:04:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:22,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:04:22,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:22,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:04:22,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:04:22,939 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 16:04:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:23,013 INFO L93 Difference]: Finished difference Result 198 states and 309 transitions. [2024-11-08 16:04:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:04:23,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-08 16:04:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:23,018 INFO L225 Difference]: With dead ends: 198 [2024-11-08 16:04:23,018 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 16:04:23,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-08 16:04:23,020 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 51 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:23,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:23,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 16:04:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-08 16:04:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:04:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2024-11-08 16:04:23,073 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 170 [2024-11-08 16:04:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:23,074 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2024-11-08 16:04:23,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 16:04:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2024-11-08 16:04:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 16:04:23,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:23,084 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:04:23,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:04:23,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:23,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash 656979501, now seen corresponding path program 1 times [2024-11-08 16:04:23,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:23,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110094099] [2024-11-08 16:04:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:04:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:04:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:04:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:04:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:04:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:04:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:04:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:04:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:04:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:04:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:04:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:04:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:04:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:04:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:04:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 16:04:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:04:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:04:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:04:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:04:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 16:04:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 16:04:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 16:04:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 16:04:23,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:23,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110094099] [2024-11-08 16:04:23,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110094099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:04:23,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316000633] [2024-11-08 16:04:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:23,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:04:23,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:23,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:04:23,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:04:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 16:04:23,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:04:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-11-08 16:04:24,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:04:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 16:04:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316000633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:04:24,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:04:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-08 16:04:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240151916] [2024-11-08 16:04:24,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:04:24,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:04:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:24,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:04:24,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:04:24,682 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 7 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 7 states have call successors, (68) [2024-11-08 16:04:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:25,185 INFO L93 Difference]: Finished difference Result 271 states and 417 transitions. [2024-11-08 16:04:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:04:25,186 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 7 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 7 states have call successors, (68) Word has length 170 [2024-11-08 16:04:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:25,189 INFO L225 Difference]: With dead ends: 271 [2024-11-08 16:04:25,189 INFO L226 Difference]: Without dead ends: 143 [2024-11-08 16:04:25,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:04:25,192 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 208 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:25,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 180 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:04:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-08 16:04:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2024-11-08 16:04:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:04:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 209 transitions. [2024-11-08 16:04:25,228 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 209 transitions. Word has length 170 [2024-11-08 16:04:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:25,229 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 209 transitions. [2024-11-08 16:04:25,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 7 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 7 states have call successors, (68) [2024-11-08 16:04:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 209 transitions. [2024-11-08 16:04:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 16:04:25,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:25,232 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:04:25,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:04:25,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:04:25,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:25,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash 371540085, now seen corresponding path program 1 times [2024-11-08 16:04:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:25,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245538843] [2024-11-08 16:04:25,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:04:25,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886650635] [2024-11-08 16:04:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:25,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:04:25,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:25,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:04:25,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:04:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:04:25,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:04:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:04:26,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:04:26,045 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:04:26,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:04:26,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:04:26,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:04:26,255 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 16:04:26,503 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:04:26,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:04:26 BoogieIcfgContainer [2024-11-08 16:04:26,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:04:26,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:04:26,508 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:04:26,508 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:04:26,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:20" (3/4) ... [2024-11-08 16:04:26,511 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:04:26,513 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:04:26,514 INFO L158 Benchmark]: Toolchain (without parser) took 6789.11ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 75.7MB in the beginning and 92.7MB in the end (delta: -17.1MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-08 16:04:26,514 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 117.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:04:26,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.48ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 60.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:04:26,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.30ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 57.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:04:26,515 INFO L158 Benchmark]: Boogie Preprocessor took 54.26ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 54.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:04:26,516 INFO L158 Benchmark]: RCFGBuilder took 656.21ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 54.3MB in the beginning and 141.5MB in the end (delta: -87.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-08 16:04:26,516 INFO L158 Benchmark]: TraceAbstraction took 5530.97ms. Allocated memory is still 172.0MB. Free memory was 140.6MB in the beginning and 93.8MB in the end (delta: 46.8MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2024-11-08 16:04:26,517 INFO L158 Benchmark]: Witness Printer took 5.67ms. Allocated memory is still 172.0MB. Free memory was 93.8MB in the beginning and 92.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:04:26,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 117.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.48ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 60.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.30ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 57.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.26ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 54.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 656.21ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 54.3MB in the beginning and 141.5MB in the end (delta: -87.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5530.97ms. Allocated memory is still 172.0MB. Free memory was 140.6MB in the beginning and 93.8MB in the end (delta: 46.8MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Witness Printer took 5.67ms. Allocated memory is still 172.0MB. Free memory was 93.8MB in the beginning and 92.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L88] var_1_6 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L95] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L97] var_1_10 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L100] var_1_12 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L101] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L103] var_1_13 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L104] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L106] var_1_14 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L107] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L109] var_1_15 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L112] var_1_16 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L115] var_1_17 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L116] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L118] var_1_19 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L119] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L122] var_1_22 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L123] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L125] var_1_24 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L126] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L127] var_1_25 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L128] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L129] var_1_26 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L130] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L143] RET updateVariables() [L144] CALL step() [L47] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L48] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L49] COND TRUE var_1_10 <= var_1_17 [L50] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L55] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L56] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L58] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L63] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L64] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L68] COND FALSE !(\read(var_1_18)) [L71] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L73] COND TRUE \read(var_1_1) [L74] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 240 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 275 mSDtfsCounter, 240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1022 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 845 ConstructedInterpolants, 0 QuantifiedInterpolants, 1514 SizeOfPredicates, 3 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 7524/7560 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-08 16:04:26,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX --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 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:04:29,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:04:29,143 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:04:29,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:04:29,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:04:29,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:04:29,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:04:29,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:04:29,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:04:29,200 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:04:29,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:04:29,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:04:29,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:04:29,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:04:29,202 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:04:29,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:04:29,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:04:29,204 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:04:29,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:04:29,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:04:29,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:04:29,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:04:29,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:04:29,212 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:04:29,212 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:04:29,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:04:29,213 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:04:29,213 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:04:29,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:04:29,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:04:29,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:04:29,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:04:29,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:04:29,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:04:29,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:04:29,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:04:29,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:04:29,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:04:29,216 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:04:29,233 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:04:29,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:04:29,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:04:29,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:04:29,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:04:29,235 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX 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 -> 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 [2024-11-08 16:04:29,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:04:29,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:04:29,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:04:29,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:04:29,678 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:04:29,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i Unable to find full path for "g++" [2024-11-08 16:04:31,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:04:32,088 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:04:32,089 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-08 16:04:32,097 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/data/be94ff25e/38fe4e4ddcda40a480461a1b0ece456d/FLAGe61eced70 [2024-11-08 16:04:32,110 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/data/be94ff25e/38fe4e4ddcda40a480461a1b0ece456d [2024-11-08 16:04:32,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:04:32,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:04:32,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:04:32,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:04:32,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:04:32,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235b6e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32, skipping insertion in model container [2024-11-08 16:04:32,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:04:32,383 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_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-08 16:04:32,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:04:32,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:04:32,509 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_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-08 16:04:32,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:04:32,593 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:04:32,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32 WrapperNode [2024-11-08 16:04:32,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:04:32,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:04:32,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:04:32,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:04:32,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,693 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-11-08 16:04:32,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:04:32,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:04:32,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:04:32,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:04:32,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,739 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-08 16:04:32,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:04:32,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:04:32,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:04:32,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:04:32,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (1/1) ... [2024-11-08 16:04:32,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:04:32,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:32,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:04:32,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:04:32,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:04:32,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:04:32,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:04:32,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:04:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:04:32,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:04:32,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:04:32,982 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:04:36,595 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 16:04:36,595 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:04:36,616 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:04:36,619 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:04:36,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:36 BoogieIcfgContainer [2024-11-08 16:04:36,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:04:36,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:04:36,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:04:36,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:04:36,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:04:32" (1/3) ... [2024-11-08 16:04:36,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347c960e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:04:36, skipping insertion in model container [2024-11-08 16:04:36,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:32" (2/3) ... [2024-11-08 16:04:36,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347c960e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:04:36, skipping insertion in model container [2024-11-08 16:04:36,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:36" (3/3) ... [2024-11-08 16:04:36,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-29.i [2024-11-08 16:04:36,657 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:04:36,657 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:04:36,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:04:36,764 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;@39a12e3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:04:36,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:04:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 16:04:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 16:04:36,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:36,796 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:04:36,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:36,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1830954061, now seen corresponding path program 1 times [2024-11-08 16:04:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:04:36,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339184852] [2024-11-08 16:04:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:36,825 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-08 16:04:36,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:04:36,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:36,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:37,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:04:37,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:04:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-08 16:04:37,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:04:37,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:04:37,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339184852] [2024-11-08 16:04:37,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339184852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:37,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:04:37,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116399538] [2024-11-08 16:04:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:37,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:04:37,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:04:37,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:04:37,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:04:37,463 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 16:04:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:37,514 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2024-11-08 16:04:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:04:37,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-11-08 16:04:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:37,528 INFO L225 Difference]: With dead ends: 137 [2024-11-08 16:04:37,528 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 16:04:37,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:04:37,540 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:37,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 16:04:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 16:04:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 16:04:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2024-11-08 16:04:37,596 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 170 [2024-11-08 16:04:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:37,596 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2024-11-08 16:04:37,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 16:04:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2024-11-08 16:04:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 16:04:37,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:37,606 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:04:37,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:04:37,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:37,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:37,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 599721199, now seen corresponding path program 1 times [2024-11-08 16:04:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:04:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256398161] [2024-11-08 16:04:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:37,810 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-08 16:04:37,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:04:37,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:37,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:04:38,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:04:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-08 16:04:38,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:04:38,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:04:38,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256398161] [2024-11-08 16:04:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256398161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:04:38,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343178641] [2024-11-08 16:04:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:38,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:04:38,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:38,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:04:38,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:04:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:04:38,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:04:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 16:04:39,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:04:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343178641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:04:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-08 16:04:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967926201] [2024-11-08 16:04:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:39,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:04:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:04:39,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:04:39,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:04:39,981 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 16:04:41,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:04:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:42,071 INFO L93 Difference]: Finished difference Result 198 states and 309 transitions. [2024-11-08 16:04:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:04:42,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-08 16:04:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:42,100 INFO L225 Difference]: With dead ends: 198 [2024-11-08 16:04:42,102 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 16:04:42,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:04:42,108 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:42,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:04:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 16:04:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-08 16:04:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:04:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2024-11-08 16:04:42,148 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 170 [2024-11-08 16:04:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:42,151 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2024-11-08 16:04:42,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 16:04:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2024-11-08 16:04:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 16:04:42,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:42,157 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:04:42,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:04:42,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:42,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:42,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:42,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:42,560 INFO L85 PathProgramCache]: Analyzing trace with hash 656979501, now seen corresponding path program 1 times [2024-11-08 16:04:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:04:42,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104493887] [2024-11-08 16:04:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:42,561 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-08 16:04:42,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:04:42,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:42,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:04:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:43,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:04:43,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:04:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-08 16:04:43,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:04:43,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:04:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104493887] [2024-11-08 16:04:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104493887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:04:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858973733] [2024-11-08 16:04:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:43,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:04:43,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:43,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:04:43,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 16:04:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:43,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:04:43,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:04:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 16:04:43,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:04:43,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858973733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:43,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:04:43,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-08 16:04:43,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769854116] [2024-11-08 16:04:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:43,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:04:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:04:43,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:04:43,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:04:43,769 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 16:04:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:46,358 INFO L93 Difference]: Finished difference Result 385 states and 605 transitions. [2024-11-08 16:04:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:04:46,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-08 16:04:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:46,363 INFO L225 Difference]: With dead ends: 385 [2024-11-08 16:04:46,363 INFO L226 Difference]: Without dead ends: 257 [2024-11-08 16:04:46,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:04:46,365 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 95 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:46,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 16:04:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-08 16:04:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-11-08 16:04:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-08 16:04:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 398 transitions. [2024-11-08 16:04:46,413 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 398 transitions. Word has length 170 [2024-11-08 16:04:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:46,414 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 398 transitions. [2024-11-08 16:04:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 16:04:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 398 transitions. [2024-11-08 16:04:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 16:04:46,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:46,418 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:04:46,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 16:04:46,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 16:04:46,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:46,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:46,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1862980433, now seen corresponding path program 1 times [2024-11-08 16:04:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:04:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538423172] [2024-11-08 16:04:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:46,821 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-08 16:04:46,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:04:46,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:46,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (7)] Waiting until timeout for monitored process [2024-11-08 16:04:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:47,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:04:47,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:04:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-08 16:04:47,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:04:47,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:04:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538423172] [2024-11-08 16:04:47,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538423172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:04:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57028409] [2024-11-08 16:04:47,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:47,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:04:47,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:47,541 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:04:47,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 16:04:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:47,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:04:47,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:04:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-08 16:04:47,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:04:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57028409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:04:47,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:04:47,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-08 16:04:47,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197299255] [2024-11-08 16:04:47,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:04:47,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:04:47,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:04:47,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:04:47,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:04:47,980 INFO L87 Difference]: Start difference. First operand 255 states and 398 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 16:04:50,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:04:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:50,960 INFO L93 Difference]: Finished difference Result 531 states and 813 transitions. [2024-11-08 16:04:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:04:50,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-11-08 16:04:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:50,981 INFO L225 Difference]: With dead ends: 531 [2024-11-08 16:04:50,981 INFO L226 Difference]: Without dead ends: 279 [2024-11-08 16:04:50,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:04:50,985 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 63 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:50,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 152 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 16:04:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-08 16:04:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2024-11-08 16:04:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 150 states have (on average 1.2133333333333334) internal successors, (182), 150 states have internal predecessors, (182), 112 states have call successors, (112), 8 states have call predecessors, (112), 8 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-08 16:04:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 406 transitions. [2024-11-08 16:04:51,046 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 406 transitions. Word has length 170 [2024-11-08 16:04:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:51,047 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 406 transitions. [2024-11-08 16:04:51,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 16:04:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 406 transitions. [2024-11-08 16:04:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 16:04:51,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:51,050 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:04:51,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 16:04:51,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (7)] Forceful destruction successful, exit code 0 [2024-11-08 16:04:51,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:51,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:51,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:51,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2146547447, now seen corresponding path program 1 times [2024-11-08 16:04:51,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:04:51,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818366468] [2024-11-08 16:04:51,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:51,453 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-08 16:04:51,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:04:51,456 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:04:51,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (9)] Waiting until timeout for monitored process [2024-11-08 16:04:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:51,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 16:04:51,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:05:10,293 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-08 16:05:20,883 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-08 16:05:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 16:05:26,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:05:26,887 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:05:26,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818366468] [2024-11-08 16:05:26,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818366468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:26,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:26,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:05:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831850161] [2024-11-08 16:05:26,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:26,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:05:26,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:05:26,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:05:26,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=89, Unknown=2, NotChecked=42, Total=182 [2024-11-08 16:05:26,890 INFO L87 Difference]: Start difference. First operand 271 states and 406 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-08 16:06:25,563 WARN L286 SmtUtils]: Spent 35.76s on a formula simplification. DAG size of input: 110 DAG size of output: 235 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:07:34,373 WARN L286 SmtUtils]: Spent 35.45s on a formula simplification. DAG size of input: 102 DAG size of output: 212 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:07:38,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:42,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:46,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:50,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:54,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:58,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:02,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:05,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:08:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:05,863 INFO L93 Difference]: Finished difference Result 599 states and 861 transitions. [2024-11-08 16:08:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 16:08:05,889 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 171 [2024-11-08 16:08:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:05,894 INFO L225 Difference]: With dead ends: 599 [2024-11-08 16:08:05,895 INFO L226 Difference]: Without dead ends: 331 [2024-11-08 16:08:05,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 135.7s TimeCoverageRelationStatistics Valid=93, Invalid=173, Unknown=14, NotChecked=62, Total=342 [2024-11-08 16:08:05,898 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 115 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 55 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:05,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 277 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 350 Invalid, 7 Unknown, 234 Unchecked, 33.8s Time] [2024-11-08 16:08:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-08 16:08:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 323. [2024-11-08 16:08:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 190 states have (on average 1.1789473684210525) internal successors, (224), 190 states have internal predecessors, (224), 112 states have call successors, (112), 20 states have call predecessors, (112), 20 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-08 16:08:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 448 transitions. [2024-11-08 16:08:05,984 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 448 transitions. Word has length 171 [2024-11-08 16:08:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:05,986 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 448 transitions. [2024-11-08 16:08:05,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-08 16:08:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 448 transitions. [2024-11-08 16:08:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 16:08:05,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:05,993 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:08:06,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (9)] Forceful destruction successful, exit code 0 [2024-11-08 16:08:06,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:08:06,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:06,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1468361479, now seen corresponding path program 1 times [2024-11-08 16:08:06,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:08:06,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254201035] [2024-11-08 16:08:06,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:06,196 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-08 16:08:06,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:08:06,197 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:08:06,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (10)] Waiting until timeout for monitored process [2024-11-08 16:08:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 16:08:06,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:08:29,158 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-08 16:08:40,093 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-08 16:08:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 16:08:46,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:08:46,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:08:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254201035] [2024-11-08 16:08:46,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254201035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:46,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:46,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:08:46,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414937483] [2024-11-08 16:08:46,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:46,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:08:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:08:46,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:08:46,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=89, Unknown=2, NotChecked=42, Total=182 [2024-11-08 16:08:46,988 INFO L87 Difference]: Start difference. First operand 323 states and 448 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-08 16:09:55,014 WARN L286 SmtUtils]: Spent 43.07s on a formula simplification. DAG size of input: 110 DAG size of output: 235 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:09:56,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:58,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:02,506 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.leq c_~var_1_25~0 .cse0) (fp.geq c_~var_1_25~0 .cse1)) (and (fp.geq c_~var_1_25~0 .cse2) (fp.leq c_~var_1_25~0 .cse3))) (or (and (fp.geq c_~var_1_26~0 .cse2) (fp.leq c_~var_1_26~0 .cse3)) (and (fp.leq c_~var_1_26~0 .cse0) (fp.geq c_~var_1_26~0 .cse1))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse7 (fp.neg .cse4)) (.cse6 (fp.neg .cse5))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6)))))))) (or (and (fp.leq c_~var_1_24~0 .cse3) (fp.geq c_~var_1_24~0 .cse2)) (and (fp.leq c_~var_1_24~0 .cse0) (fp.geq c_~var_1_24~0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-08 16:10:07,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:10:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:10:07,837 INFO L93 Difference]: Finished difference Result 973 states and 1350 transitions. [2024-11-08 16:10:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 16:10:07,844 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 171 [2024-11-08 16:10:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:10:07,854 INFO L225 Difference]: With dead ends: 973 [2024-11-08 16:10:07,854 INFO L226 Difference]: Without dead ends: 653 [2024-11-08 16:10:07,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 81.2s TimeCoverageRelationStatistics Valid=89, Invalid=155, Unknown=8, NotChecked=90, Total=342 [2024-11-08 16:10:07,857 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 180 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:10:07,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 331 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 310 Invalid, 0 Unknown, 447 Unchecked, 10.6s Time] [2024-11-08 16:10:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-08 16:10:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 641. [2024-11-08 16:10:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 376 states have (on average 1.1808510638297873) internal successors, (444), 376 states have internal predecessors, (444), 224 states have call successors, (224), 40 states have call predecessors, (224), 40 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-08 16:10:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 892 transitions. [2024-11-08 16:10:07,972 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 892 transitions. Word has length 171 [2024-11-08 16:10:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:10:07,973 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 892 transitions. [2024-11-08 16:10:07,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2024-11-08 16:10:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 892 transitions. [2024-11-08 16:10:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 16:10:07,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:10:07,978 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:10:07,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (10)] Ended with exit code 0 [2024-11-08 16:10:08,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:10:08,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:10:08,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:10:08,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1753520437, now seen corresponding path program 1 times [2024-11-08 16:10:08,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:10:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034788059] [2024-11-08 16:10:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:10:08,184 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-08 16:10:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:10:08,189 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:10:08,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (11)] Waiting until timeout for monitored process [2024-11-08 16:10:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:08,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:10:08,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:10:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 16:10:09,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:10:09,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:10:09,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034788059] [2024-11-08 16:10:09,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034788059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:10:09,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:10:09,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:10:09,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724586471] [2024-11-08 16:10:09,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:10:09,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:10:09,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:10:09,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:10:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:10:09,735 INFO L87 Difference]: Start difference. First operand 641 states and 892 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 16:10:11,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:10:13,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:10:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:10:13,944 INFO L93 Difference]: Finished difference Result 1439 states and 2005 transitions. [2024-11-08 16:10:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:10:13,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2024-11-08 16:10:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:10:13,952 INFO L225 Difference]: With dead ends: 1439 [2024-11-08 16:10:13,952 INFO L226 Difference]: Without dead ends: 801 [2024-11-08 16:10:13,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 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-08 16:10:13,955 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 19 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:10:13,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 214 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 16:10:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-08 16:10:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2024-11-08 16:10:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 468 states have (on average 1.1773504273504274) internal successors, (551), 468 states have internal predecessors, (551), 280 states have call successors, (280), 50 states have call predecessors, (280), 50 states have return successors, (280), 280 states have call predecessors, (280), 280 states have call successors, (280) [2024-11-08 16:10:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1111 transitions. [2024-11-08 16:10:14,081 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1111 transitions. Word has length 171 [2024-11-08 16:10:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:10:14,082 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1111 transitions. [2024-11-08 16:10:14,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 16:10:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1111 transitions. [2024-11-08 16:10:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 16:10:14,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:10:14,085 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:10:14,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (11)] Ended with exit code 0 [2024-11-08 16:10:14,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:10:14,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:10:14,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:10:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1287678023, now seen corresponding path program 1 times [2024-11-08 16:10:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:10:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429546631] [2024-11-08 16:10:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:10:14,286 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-08 16:10:14,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:10:14,288 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:10:14,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (12)] Waiting until timeout for monitored process [2024-11-08 16:10:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:14,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:10:14,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:10:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 133 proven. 78 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2024-11-08 16:10:15,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:10:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 16:10:16,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:10:16,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429546631] [2024-11-08 16:10:16,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429546631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:10:16,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:10:16,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 16:10:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594034397] [2024-11-08 16:10:16,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:10:16,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:10:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:10:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:10:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:10:16,814 INFO L87 Difference]: Start difference. First operand 799 states and 1111 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-08 16:10:19,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:10:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:10:19,818 INFO L93 Difference]: Finished difference Result 2105 states and 2857 transitions. [2024-11-08 16:10:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 16:10:19,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 172 [2024-11-08 16:10:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:10:19,828 INFO L225 Difference]: With dead ends: 2105 [2024-11-08 16:10:19,829 INFO L226 Difference]: Without dead ends: 1309 [2024-11-08 16:10:19,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:10:19,833 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 140 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:10:19,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 241 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 16:10:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2024-11-08 16:10:19,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 839. [2024-11-08 16:10:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 498 states have (on average 1.1566265060240963) internal successors, (576), 498 states have internal predecessors, (576), 280 states have call successors, (280), 60 states have call predecessors, (280), 60 states have return successors, (280), 280 states have call predecessors, (280), 280 states have call successors, (280) [2024-11-08 16:10:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1136 transitions. [2024-11-08 16:10:19,984 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1136 transitions. Word has length 172 [2024-11-08 16:10:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:10:19,985 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1136 transitions. [2024-11-08 16:10:19,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-08 16:10:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1136 transitions. [2024-11-08 16:10:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 16:10:19,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:10:19,988 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:10:20,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (12)] Ended with exit code 0 [2024-11-08 16:10:20,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:10:20,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:10:20,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:10:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1230419721, now seen corresponding path program 1 times [2024-11-08 16:10:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:10:20,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612725978] [2024-11-08 16:10:20,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:10:20,189 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-08 16:10:20,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:10:20,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:10:20,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (13)] Waiting until timeout for monitored process [2024-11-08 16:10:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:20,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:10:20,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:10:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 258 proven. 144 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-11-08 16:10:22,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:10:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 16:10:23,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:10:23,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612725978] [2024-11-08 16:10:23,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612725978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:10:23,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:10:23,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-08 16:10:23,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567494150] [2024-11-08 16:10:23,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:10:23,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:10:23,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:10:23,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:10:23,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:10:23,794 INFO L87 Difference]: Start difference. First operand 839 states and 1136 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-11-08 16:10:26,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:10:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:10:27,935 INFO L93 Difference]: Finished difference Result 1808 states and 2382 transitions. [2024-11-08 16:10:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 16:10:27,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 172 [2024-11-08 16:10:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:10:27,948 INFO L225 Difference]: With dead ends: 1808 [2024-11-08 16:10:27,948 INFO L226 Difference]: Without dead ends: 972 [2024-11-08 16:10:27,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:10:27,954 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:10:27,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 369 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 16:10:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-11-08 16:10:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 919. [2024-11-08 16:10:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 558 states have (on average 1.1129032258064515) internal successors, (621), 558 states have internal predecessors, (621), 280 states have call successors, (280), 80 states have call predecessors, (280), 80 states have return successors, (280), 280 states have call predecessors, (280), 280 states have call successors, (280) [2024-11-08 16:10:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1181 transitions. [2024-11-08 16:10:28,117 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1181 transitions. Word has length 172 [2024-11-08 16:10:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:10:28,117 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1181 transitions. [2024-11-08 16:10:28,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-11-08 16:10:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1181 transitions. [2024-11-08 16:10:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 16:10:28,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:10:28,122 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:10:28,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (13)] Forceful destruction successful, exit code 0 [2024-11-08 16:10:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:10:28,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:10:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:10:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2039766347, now seen corresponding path program 1 times [2024-11-08 16:10:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:10:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638251902] [2024-11-08 16:10:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:10:28,324 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-08 16:10:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:10:28,325 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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-08 16:10:28,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd21bfec-3d1f-43ee-ba90-467c996b7f3e/bin/uautomizer-verify-jihMAELWvX/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 (14)] Waiting until timeout for monitored process [2024-11-08 16:10:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:10:28,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 16:10:28,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:11:06,601 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:11:35,522 WARN L286 SmtUtils]: Spent 11.95s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:11:44,499 WARN L286 SmtUtils]: Spent 5.37s 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-08 16:12:08,715 WARN L286 SmtUtils]: Spent 5.87s 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-08 16:12:25,570 WARN L286 SmtUtils]: Spent 7.21s 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-08 16:12:35,940 WARN L286 SmtUtils]: Spent 7.07s 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-08 16:13:57,507 WARN L286 SmtUtils]: Spent 47.99s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:14:40,665 WARN L286 SmtUtils]: Spent 5.12s 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-08 16:14:46,767 WARN L286 SmtUtils]: Spent 6.10s 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-08 16:16:13,894 WARN L286 SmtUtils]: Spent 53.75s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:16:33,770 WARN L286 SmtUtils]: Spent 5.69s 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-08 16:16:38,887 WARN L286 SmtUtils]: Spent 5.12s 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-08 16:16:49,959 WARN L286 SmtUtils]: Spent 6.31s 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-08 16:16:55,343 WARN L286 SmtUtils]: Spent 5.38s 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-08 16:17:00,950 WARN L286 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:17:14,125 WARN L286 SmtUtils]: Spent 5.20s 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-08 16:17:28,793 WARN L286 SmtUtils]: Spent 5.35s 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-08 16:17:33,857 WARN L286 SmtUtils]: Spent 5.06s 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-08 16:19:14,421 WARN L286 SmtUtils]: Spent 1.10m on a formula simplification that was a NOOP. DAG size: 83 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)