./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:41:31,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:41:31,876 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:41:31,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:41:31,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:41:31,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:41:31,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:41:31,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:41:31,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:41:31,932 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:41:31,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:41:31,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:41:31,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:41:31,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:41:31,933 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:41:31,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:41:31,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:41:31,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:41:31,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:41:31,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:41:31,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:41:31,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:41:31,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:41:31,938 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-11-13 14:41:32,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:41:32,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:41:32,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:41:32,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:41:32,347 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:41:32,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i Unable to find full path for "g++" [2024-11-13 14:41:34,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:41:34,676 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:41:34,677 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-13 14:41:34,686 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/data/366b4182b/a7ee83e7406c4e178bfcb2ad10ceddae/FLAG332e66897 [2024-11-13 14:41:34,707 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/data/366b4182b/a7ee83e7406c4e178bfcb2ad10ceddae [2024-11-13 14:41:34,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:41:34,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:41:34,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:41:34,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:41:34,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:41:34,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:41:34" (1/1) ... [2024-11-13 14:41:34,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34291ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:34, skipping insertion in model container [2024-11-13 14:41:34,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:41:34" (1/1) ... [2024-11-13 14:41:34,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:41:34,939 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_29552114-3308-40d9-828c-fdadb302340d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-13 14:41:35,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:41:35,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:41:35,069 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_29552114-3308-40d9-828c-fdadb302340d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-13 14:41:35,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:41:35,193 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:41:35,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35 WrapperNode [2024-11-13 14:41:35,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:41:35,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:41:35,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:41:35,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:41:35,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,273 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2024-11-13 14:41:35,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:41:35,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:41:35,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:41:35,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:41:35,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,339 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-11-13 14:41:35,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:41:35,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:41:35,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:41:35,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:41:35,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (1/1) ... [2024-11-13 14:41:35,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:41:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:41:35,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:41:35,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:41:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:41:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:41:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:41:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:41:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 14:41:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 14:41:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 14:41:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 14:41:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 14:41:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 14:41:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 14:41:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 14:41:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 14:41:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 14:41:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 14:41:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 14:41:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 14:41:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 14:41:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 14:41:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:41:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:41:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:41:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 14:41:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 14:41:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 14:41:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 14:41:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 14:41:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 14:41:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 14:41:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 14:41:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 14:41:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:41:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:41:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:41:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:41:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:41:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 14:41:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 14:41:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 14:41:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:41:35,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:41:35,704 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:41:35,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:41:36,368 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-13 14:41:36,368 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:41:36,382 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:41:36,382 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:41:36,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:36 BoogieIcfgContainer [2024-11-13 14:41:36,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:41:36,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:41:36,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:41:36,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:41:36,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:41:34" (1/3) ... [2024-11-13 14:41:36,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b6a9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:41:36, skipping insertion in model container [2024-11-13 14:41:36,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:35" (2/3) ... [2024-11-13 14:41:36,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b6a9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:41:36, skipping insertion in model container [2024-11-13 14:41:36,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:36" (3/3) ... [2024-11-13 14:41:36,392 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-11-13 14:41:36,409 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:41:36,411 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-48.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:41:36,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:41:36,488 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;@5bce232c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:41:36,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:41:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:36,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:36,510 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:36,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:36,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash -767233647, now seen corresponding path program 1 times [2024-11-13 14:41:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:36,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129904560] [2024-11-13 14:41:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:41:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:41:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:41:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:41:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:41:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:41:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:41:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:41:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:41:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:41:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:41:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 14:41:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:41:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:41:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:41:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:41:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:41:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:41:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 14:41:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:41:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 14:41:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:41:37,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:37,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129904560] [2024-11-13 14:41:37,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129904560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:37,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:41:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666135892] [2024-11-13 14:41:37,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:37,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:41:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:37,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:41:37,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:41:37,128 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:41:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:37,180 INFO L93 Difference]: Finished difference Result 229 states and 361 transitions. [2024-11-13 14:41:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:41:37,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-13 14:41:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:37,194 INFO L225 Difference]: With dead ends: 229 [2024-11-13 14:41:37,194 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 14:41:37,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-13 14:41:37,204 INFO L432 NwaCegarLoop]: 164 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, 164 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-13 14:41:37,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:41:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 14:41:37,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-13 14:41:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-13 14:41:37,272 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2024-11-13 14:41:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:37,274 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-13 14:41:37,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:41:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-13 14:41:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:37,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:37,283 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:37,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:41:37,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:37,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2103332169, now seen corresponding path program 1 times [2024-11-13 14:41:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:37,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675517838] [2024-11-13 14:41:37,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:41:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:41:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:41:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:41:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:41:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:41:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:41:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:41:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:41:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:41:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:41:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 14:41:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:41:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:41:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:41:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:41:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:41:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:41:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 14:41:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:41:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 14:41:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:41:38,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:38,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675517838] [2024-11-13 14:41:38,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675517838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:38,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:38,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:41:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645612360] [2024-11-13 14:41:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:38,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:41:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:38,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:41:38,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:38,022 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:41:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:38,106 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-13 14:41:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:41:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-13 14:41:38,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:38,109 INFO L225 Difference]: With dead ends: 227 [2024-11-13 14:41:38,109 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 14:41:38,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:38,111 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:41:38,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:41:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 14:41:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-13 14:41:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-13 14:41:38,126 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2024-11-13 14:41:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:38,128 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-13 14:41:38,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:41:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-13 14:41:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:38,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:38,131 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:38,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:41:38,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:38,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1244597241, now seen corresponding path program 1 times [2024-11-13 14:41:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347678878] [2024-11-13 14:41:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:41:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:41:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:41:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:41:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:41:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:41:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:41:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:41:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:41:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:41:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:41:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 14:41:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:41:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:41:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:41:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:41:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:41:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:41:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 14:41:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:41:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 14:41:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:41:38,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:38,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347678878] [2024-11-13 14:41:38,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347678878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:38,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:38,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:41:38,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821082120] [2024-11-13 14:41:38,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:38,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:41:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:38,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:41:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:38,642 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:41:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:38,717 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-11-13 14:41:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:41:38,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-13 14:41:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:38,720 INFO L225 Difference]: With dead ends: 232 [2024-11-13 14:41:38,720 INFO L226 Difference]: Without dead ends: 119 [2024-11-13 14:41:38,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:38,726 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:41:38,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 472 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:41:38,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-13 14:41:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-13 14:41:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-13 14:41:38,755 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 168 [2024-11-13 14:41:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:38,759 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-13 14:41:38,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:41:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-13 14:41:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:38,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:38,765 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:38,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:41:38,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:38,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:38,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1924655611, now seen corresponding path program 1 times [2024-11-13 14:41:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:38,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924413926] [2024-11-13 14:41:38,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:38,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:41:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:41:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:41:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:41:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:41:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:41:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:41:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:41:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:41:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:41:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:41:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 14:41:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:41:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:41:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:41:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:41:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:41:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:41:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 14:41:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:41:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 14:41:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:41:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924413926] [2024-11-13 14:41:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924413926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:41:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931913542] [2024-11-13 14:41:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:39,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:41:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:39,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:41:39,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:39,174 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:41:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:39,217 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2024-11-13 14:41:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:41:39,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-13 14:41:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:39,220 INFO L225 Difference]: With dead ends: 236 [2024-11-13 14:41:39,220 INFO L226 Difference]: Without dead ends: 121 [2024-11-13 14:41:39,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:39,221 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:41:39,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:41:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-13 14:41:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-13 14:41:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-11-13 14:41:39,232 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 168 [2024-11-13 14:41:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:39,232 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-11-13 14:41:39,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:41:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-13 14:41:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:39,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:39,235 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:39,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:41:39,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:39,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash -595304323, now seen corresponding path program 1 times [2024-11-13 14:41:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:39,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492480294] [2024-11-13 14:41:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:39,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:41:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:41:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:41:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:41:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:41:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:41:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:41:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:41:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:41:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:41:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:41:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 14:41:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:41:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:41:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:41:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:41:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:41:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:41:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 14:41:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:41:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 14:41:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:41:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:39,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492480294] [2024-11-13 14:41:39,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492480294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:39,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:39,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:41:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268403224] [2024-11-13 14:41:39,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:39,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:41:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:41:39,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:39,600 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:41:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:39,654 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2024-11-13 14:41:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:41:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-13 14:41:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:39,658 INFO L225 Difference]: With dead ends: 240 [2024-11-13 14:41:39,658 INFO L226 Difference]: Without dead ends: 123 [2024-11-13 14:41:39,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:39,663 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:41:39,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:41:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-13 14:41:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-13 14:41:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-11-13 14:41:39,686 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 168 [2024-11-13 14:41:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:39,686 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-11-13 14:41:39,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:41:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-11-13 14:41:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:39,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:39,691 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:39,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:41:39,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:39,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash -593457281, now seen corresponding path program 1 times [2024-11-13 14:41:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:39,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883031173] [2024-11-13 14:41:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:41:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:41:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:41:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:41:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:41:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:41:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 14:41:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:41:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:41:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:41:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:41:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 14:41:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 14:41:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:41:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:41:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:41:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:41:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:41:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 14:41:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:41:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 14:41:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:41:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:42,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883031173] [2024-11-13 14:41:42,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883031173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:42,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:42,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:41:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983005957] [2024-11-13 14:41:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:42,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:41:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:42,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:41:42,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:41:42,858 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-13 14:41:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:43,066 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2024-11-13 14:41:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:41:43,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) Word has length 168 [2024-11-13 14:41:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:43,069 INFO L225 Difference]: With dead ends: 241 [2024-11-13 14:41:43,070 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 14:41:43,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:41:43,071 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:41:43,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 691 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:41:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 14:41:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-13 14:41:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-13 14:41:43,093 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 168 [2024-11-13 14:41:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:43,094 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-13 14:41:43,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-13 14:41:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-13 14:41:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:43,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:43,098 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:43,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:41:43,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:43,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2012566273, now seen corresponding path program 1 times [2024-11-13 14:41:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:43,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665045640] [2024-11-13 14:41:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:43,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:41:43,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:41:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:41:43,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:41:43,539 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:41:43,541 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:41:43,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:41:43,548 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:43,718 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:41:43,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:41:43 BoogieIcfgContainer [2024-11-13 14:41:43,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:41:43,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:41:43,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:41:43,727 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:41:43,728 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:36" (3/4) ... [2024-11-13 14:41:43,730 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:41:43,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:41:43,734 INFO L158 Benchmark]: Toolchain (without parser) took 9021.79ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.7MB in the beginning and 119.8MB in the end (delta: -28.1MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2024-11-13 14:41:43,735 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 83.9MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:41:43,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.77ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:41:43,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.43ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 70.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:41:43,736 INFO L158 Benchmark]: Boogie Preprocessor took 139.93ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 65.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:41:43,736 INFO L158 Benchmark]: RCFGBuilder took 968.03ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 83.5MB in the end (delta: -17.7MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-13 14:41:43,737 INFO L158 Benchmark]: TraceAbstraction took 7341.24ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 83.5MB in the beginning and 119.8MB in the end (delta: -36.3MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-11-13 14:41:43,737 INFO L158 Benchmark]: Witness Printer took 5.34ms. Allocated memory is still 201.3MB. Free memory was 119.8MB in the beginning and 119.8MB in the end (delta: 17.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:41:43,741 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.51ms. Allocated memory is still 83.9MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.77ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 75.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.43ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 70.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 139.93ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 65.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 968.03ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 83.5MB in the end (delta: -17.7MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7341.24ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 83.5MB in the beginning and 119.8MB in the end (delta: -36.3MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * Witness Printer took 5.34ms. Allocated memory is still 201.3MB. Free memory was 119.8MB in the beginning and 119.8MB in the end (delta: 17.0kB). There was no memory consumed. 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 41, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L37] unsigned char last_1_unsigned_char_Array_0_0__1_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR unsigned_char_Array_0[0][1] [L104] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] float_Array_0[0][0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] float_Array_0[1][0] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0][1] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1][1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[0][2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_char_Array_0[2][1] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L97] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_char_Array_0[2][2] = __VERIFIER_nondet_uchar() [L100] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L115] RET updateVariables() [L116] CALL step() [L41] EXPR float_Array_0[0][2] [L41] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(float_Array_0[0][2] <= float_Array_0[1][1]) [L48] EXPR float_Array_0[0][0] [L48] float_Array_0[1][2] = float_Array_0[0][0] [L50] EXPR unsigned_char_Array_0[0][2] [L50] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[0][2] [L51] EXPR unsigned_char_Array_0[2][1] [L51] signed_long_int_Array_0[0] = unsigned_char_Array_0[2][1] [L52] unsigned_char_Array_0[2][0] = 4 [L53] EXPR signed_long_int_Array_0[0] [L53] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L54] EXPR unsigned_char_Array_0[2][1] [L54] EXPR unsigned_char_Array_0[0][0] [L54] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] COND FALSE !(((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > stepLocal_0) [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR float_Array_0[0][2] [L107] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) [L107] EXPR float_Array_0[1][2] [L107] EXPR float_Array_0[0][0] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107-L108] return ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2750 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1781 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 969 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 1043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 5040/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:41:43,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:41:46,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:41:46,979 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:41:46,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:41:46,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:41:47,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:41:47,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:41:47,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:41:47,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:41:47,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:41:47,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:41:47,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:41:47,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:41:47,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:41:47,020 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:41:47,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:41:47,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:41:47,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:41:47,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:41:47,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:41:47,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:41:47,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:41:47,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:41:47,021 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:41:47,021 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:41:47,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:41:47,022 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:41:47,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:41:47,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:41:47,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:41:47,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:41:47,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:41:47,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:41:47,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:41:47,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:41:47,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:41:47,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:41:47,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:41:47,024 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:41:47,024 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:41:47,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:41:47,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:41:47,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:41:47,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:41:47,025 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-11-13 14:41:47,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:41:47,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:41:47,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:41:47,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:41:47,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:41:47,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i Unable to find full path for "g++" [2024-11-13 14:41:49,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:41:49,932 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:41:49,933 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-13 14:41:49,952 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/data/0e4b512b6/a3725175c4794219ad0f4eace1b38ed7/FLAG2123e5d51 [2024-11-13 14:41:49,979 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/data/0e4b512b6/a3725175c4794219ad0f4eace1b38ed7 [2024-11-13 14:41:49,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:41:49,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:41:49,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:41:49,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:41:49,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:41:49,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:41:49" (1/1) ... [2024-11-13 14:41:49,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5752a41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:49, skipping insertion in model container [2024-11-13 14:41:49,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:41:49" (1/1) ... [2024-11-13 14:41:50,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:41:50,193 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_29552114-3308-40d9-828c-fdadb302340d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-13 14:41:50,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:41:50,351 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:41:50,367 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_29552114-3308-40d9-828c-fdadb302340d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-13 14:41:50,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:41:50,493 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:41:50,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50 WrapperNode [2024-11-13 14:41:50,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:41:50,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:41:50,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:41:50,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:41:50,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,612 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2024-11-13 14:41:50,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:41:50,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:41:50,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:41:50,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:41:50,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,661 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-11-13 14:41:50,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:41:50,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:41:50,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:41:50,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:41:50,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:41:50,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:41:50,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:41:50,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:41:50,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:41:50,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 14:41:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 14:41:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 14:41:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 14:41:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 14:41:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 14:41:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:41:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:41:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:41:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 14:41:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 14:41:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 14:41:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 14:41:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 14:41:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 14:41:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 14:41:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 14:41:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 14:41:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 14:41:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 14:41:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 14:41:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-13 14:41:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-13 14:41:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-13 14:41:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-13 14:41:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:41:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:41:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 14:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 14:41:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 14:41:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 14:41:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:41:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:41:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 14:41:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 14:41:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 14:41:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 14:41:51,067 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:41:51,069 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:41:53,098 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-13 14:41:53,098 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:41:53,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:41:53,111 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:41:53,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:53 BoogieIcfgContainer [2024-11-13 14:41:53,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:41:53,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:41:53,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:41:53,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:41:53,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:41:49" (1/3) ... [2024-11-13 14:41:53,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edf303d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:41:53, skipping insertion in model container [2024-11-13 14:41:53,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (2/3) ... [2024-11-13 14:41:53,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edf303d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:41:53, skipping insertion in model container [2024-11-13 14:41:53,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:53" (3/3) ... [2024-11-13 14:41:53,124 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-11-13 14:41:53,141 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:41:53,143 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-48.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:41:53,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:41:53,237 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;@133cb1e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:41:53,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:41:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:53,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:53,259 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:53,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:53,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash -767233647, now seen corresponding path program 1 times [2024-11-13 14:41:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:41:53,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563035822] [2024-11-13 14:41:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:53,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:41:53,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:41:53,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:41:53,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 14:41:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:41:53,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:41:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-13 14:41:53,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:41:53,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:41:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563035822] [2024-11-13 14:41:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563035822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:53,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:53,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:41:53,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590898978] [2024-11-13 14:41:53,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:53,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:41:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:41:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:41:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:41:53,978 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:41:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:54,015 INFO L93 Difference]: Finished difference Result 229 states and 361 transitions. [2024-11-13 14:41:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:41:54,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-13 14:41:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:54,026 INFO L225 Difference]: With dead ends: 229 [2024-11-13 14:41:54,026 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 14:41:54,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-13 14:41:54,034 INFO L432 NwaCegarLoop]: 164 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, 164 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-13 14:41:54,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:41:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 14:41:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-13 14:41:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-13 14:41:54,090 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2024-11-13 14:41:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:54,091 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-13 14:41:54,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:41:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-13 14:41:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:54,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:54,096 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:54,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 14:41:54,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:41:54,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:54,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2103332169, now seen corresponding path program 1 times [2024-11-13 14:41:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:41:54,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52101974] [2024-11-13 14:41:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:54,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:41:54,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:41:54,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:41:54,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 14:41:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:54,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:41:54,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:41:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-11-13 14:41:54,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:41:54,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:41:54,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52101974] [2024-11-13 14:41:54,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52101974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:54,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:54,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:41:54,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219108119] [2024-11-13 14:41:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:54,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:41:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:41:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:41:54,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:54,942 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:41:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:55,052 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-13 14:41:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:41:55,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-13 14:41:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:55,055 INFO L225 Difference]: With dead ends: 227 [2024-11-13 14:41:55,055 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 14:41:55,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:55,057 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:41:55,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:41:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 14:41:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-13 14:41:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-13 14:41:55,089 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2024-11-13 14:41:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:55,091 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-13 14:41:55,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:41:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-13 14:41:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:55,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:55,098 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:55,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:41:55,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:41:55,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:55,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1244597241, now seen corresponding path program 1 times [2024-11-13 14:41:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:41:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328884948] [2024-11-13 14:41:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:55,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:41:55,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:41:55,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:41:55,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 14:41:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:55,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:41:55,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:41:56,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2024-11-13 14:41:56,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:41:56,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2024-11-13 14:41:56,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2024-11-13 14:41:56,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:41:56,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2024-11-13 14:41:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-13 14:41:56,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:41:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 14:41:57,721 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:41:57,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328884948] [2024-11-13 14:41:57,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328884948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:41:57,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:41:57,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-13 14:41:57,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183903971] [2024-11-13 14:41:57,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:41:57,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:41:57,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:41:57,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:41:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:41:57,725 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-13 14:41:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:59,288 INFO L93 Difference]: Finished difference Result 358 states and 506 transitions. [2024-11-13 14:41:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 14:41:59,289 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) Word has length 168 [2024-11-13 14:41:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:59,292 INFO L225 Difference]: With dead ends: 358 [2024-11-13 14:41:59,292 INFO L226 Difference]: Without dead ends: 245 [2024-11-13 14:41:59,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:41:59,294 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 233 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:41:59,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1160 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:41:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-13 14:41:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 122. [2024-11-13 14:41:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:41:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-13 14:41:59,334 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 168 [2024-11-13 14:41:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:59,336 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-13 14:41:59,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-13 14:41:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-13 14:41:59,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:41:59,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:59,343 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:59,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 14:41:59,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:41:59,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:59,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:59,545 INFO L85 PathProgramCache]: Analyzing trace with hash -444346501, now seen corresponding path program 1 times [2024-11-13 14:41:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:41:59,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140984347] [2024-11-13 14:41:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:41:59,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:41:59,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:41:59,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 14:42:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:00,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:42:00,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:42:00,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:00,112 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140984347] [2024-11-13 14:42:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140984347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:00,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:00,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:42:00,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370206829] [2024-11-13 14:42:00,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:00,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:42:00,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:00,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:42:00,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:42:00,115 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:00,197 INFO L93 Difference]: Finished difference Result 246 states and 346 transitions. [2024-11-13 14:42:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:42:00,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-13 14:42:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:00,200 INFO L225 Difference]: With dead ends: 246 [2024-11-13 14:42:00,201 INFO L226 Difference]: Without dead ends: 127 [2024-11-13 14:42:00,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:42:00,202 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:00,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:42:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-13 14:42:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-13 14:42:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:42:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 175 transitions. [2024-11-13 14:42:00,222 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 175 transitions. Word has length 168 [2024-11-13 14:42:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:00,222 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 175 transitions. [2024-11-13 14:42:00,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2024-11-13 14:42:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:42:00,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:00,226 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:00,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 14:42:00,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:00,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:00,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 235711869, now seen corresponding path program 1 times [2024-11-13 14:42:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162957954] [2024-11-13 14:42:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:00,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:00,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:00,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:00,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 14:42:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:00,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:42:00,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:42:00,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:00,925 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162957954] [2024-11-13 14:42:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162957954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:42:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270789542] [2024-11-13 14:42:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:42:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:42:00,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:42:00,930 INFO L87 Difference]: Start difference. First operand 126 states and 175 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:01,053 INFO L93 Difference]: Finished difference Result 252 states and 351 transitions. [2024-11-13 14:42:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:42:01,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-13 14:42:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:01,058 INFO L225 Difference]: With dead ends: 252 [2024-11-13 14:42:01,060 INFO L226 Difference]: Without dead ends: 129 [2024-11-13 14:42:01,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:42:01,061 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:01,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 765 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:42:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-13 14:42:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-13 14:42:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:42:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 177 transitions. [2024-11-13 14:42:01,084 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 177 transitions. Word has length 168 [2024-11-13 14:42:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:01,084 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 177 transitions. [2024-11-13 14:42:01,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2024-11-13 14:42:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:42:01,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:01,087 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:01,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 14:42:01,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:01,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:01,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2010719231, now seen corresponding path program 1 times [2024-11-13 14:42:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:01,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842789197] [2024-11-13 14:42:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:01,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:01,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:01,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:01,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 14:42:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:01,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:42:01,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:42:01,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:01,777 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:01,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842789197] [2024-11-13 14:42:01,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842789197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:01,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:01,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:42:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302803209] [2024-11-13 14:42:01,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:01,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:42:01,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:01,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:42:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:42:01,779 INFO L87 Difference]: Start difference. First operand 128 states and 177 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:01,933 INFO L93 Difference]: Finished difference Result 256 states and 355 transitions. [2024-11-13 14:42:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:42:01,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-13 14:42:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:01,937 INFO L225 Difference]: With dead ends: 256 [2024-11-13 14:42:01,939 INFO L226 Difference]: Without dead ends: 131 [2024-11-13 14:42:01,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:42:01,941 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:01,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 911 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:42:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-13 14:42:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-13 14:42:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:42:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-11-13 14:42:01,978 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 168 [2024-11-13 14:42:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:01,979 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-11-13 14:42:01,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-11-13 14:42:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:42:01,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:01,985 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:01,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 14:42:02,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:02,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:02,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2012566273, now seen corresponding path program 1 times [2024-11-13 14:42:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742452888] [2024-11-13 14:42:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:02,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:02,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:02,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:02,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 14:42:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:02,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:42:02,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:02,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-13 14:42:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-13 14:42:02,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:02,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742452888] [2024-11-13 14:42:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742452888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:02,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:02,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:42:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214735003] [2024-11-13 14:42:02,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:42:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:02,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:42:02,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:42:02,852 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:42:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:04,844 INFO L93 Difference]: Finished difference Result 258 states and 356 transitions. [2024-11-13 14:42:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:42:04,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-13 14:42:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:04,854 INFO L225 Difference]: With dead ends: 258 [2024-11-13 14:42:04,854 INFO L226 Difference]: Without dead ends: 131 [2024-11-13 14:42:04,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:42:04,855 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 144 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:04,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 496 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 14:42:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-13 14:42:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-13 14:42:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 106 states have internal predecessors, (136), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:42:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2024-11-13 14:42:04,872 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 168 [2024-11-13 14:42:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:04,873 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2024-11-13 14:42:04,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:42:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2024-11-13 14:42:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:42:04,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:04,876 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:04,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-13 14:42:05,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:05,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:05,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:05,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1355970851, now seen corresponding path program 1 times [2024-11-13 14:42:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:05,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85491649] [2024-11-13 14:42:05,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:05,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:05,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:05,080 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:05,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-13 14:42:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:42:05,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2024-11-13 14:42:05,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:05,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85491649] [2024-11-13 14:42:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85491649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:42:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554308344] [2024-11-13 14:42:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:05,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:42:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:05,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:42:05,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:42:05,609 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-13 14:42:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:05,932 INFO L93 Difference]: Finished difference Result 263 states and 360 transitions. [2024-11-13 14:42:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:42:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 170 [2024-11-13 14:42:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:05,935 INFO L225 Difference]: With dead ends: 263 [2024-11-13 14:42:05,935 INFO L226 Difference]: Without dead ends: 134 [2024-11-13 14:42:05,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:42:05,936 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:05,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:42:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-13 14:42:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2024-11-13 14:42:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:42:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2024-11-13 14:42:05,951 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 170 [2024-11-13 14:42:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:05,952 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2024-11-13 14:42:05,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-13 14:42:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2024-11-13 14:42:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:42:05,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:05,954 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:05,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-13 14:42:06,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:06,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:06,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1199990309, now seen corresponding path program 1 times [2024-11-13 14:42:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:06,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747431303] [2024-11-13 14:42:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:06,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:06,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:06,160 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:06,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-13 14:42:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:06,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:42:06,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:06,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-13 14:42:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-11-13 14:42:06,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:06,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747431303] [2024-11-13 14:42:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747431303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:06,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:06,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:42:06,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385640332] [2024-11-13 14:42:06,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:06,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:42:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:42:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:42:06,807 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:42:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:08,644 INFO L93 Difference]: Finished difference Result 258 states and 352 transitions. [2024-11-13 14:42:08,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:42:08,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2024-11-13 14:42:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:08,654 INFO L225 Difference]: With dead ends: 258 [2024-11-13 14:42:08,654 INFO L226 Difference]: Without dead ends: 131 [2024-11-13 14:42:08,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:42:08,656 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 134 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:08,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 490 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 14:42:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-13 14:42:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-13 14:42:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 106 states have internal predecessors, (134), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 14:42:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-11-13 14:42:08,669 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 170 [2024-11-13 14:42:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:08,670 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-11-13 14:42:08,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:42:08,670 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-11-13 14:42:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 14:42:08,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:08,672 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:08,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-13 14:42:08,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:08,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:08,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1566734911, now seen corresponding path program 1 times [2024-11-13 14:42:08,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:08,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186808] [2024-11-13 14:42:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:08,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:08,876 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:08,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-13 14:42:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:09,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 14:42:09,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:09,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:42:10,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:10,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:10,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:10,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:11,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-13 14:42:11,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:11,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2024-11-13 14:42:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-13 14:42:11,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:42:11,906 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:11,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186808] [2024-11-13 14:42:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:42:11,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351050840] [2024-11-13 14:42:11,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:11,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:11,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:42:11,916 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:42:11,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:42:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:12,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 14:42:12,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:12,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:13,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:13,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:13,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:14,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-13 14:42:14,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:14,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2024-11-13 14:42:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-13 14:42:14,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:42:14,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351050840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:42:14,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:42:14,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2024-11-13 14:42:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068327259] [2024-11-13 14:42:14,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:42:14,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:42:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:42:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:42:14,567 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-13 14:42:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:20,917 INFO L93 Difference]: Finished difference Result 391 states and 528 transitions. [2024-11-13 14:42:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 14:42:20,919 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 172 [2024-11-13 14:42:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:20,921 INFO L225 Difference]: With dead ends: 391 [2024-11-13 14:42:20,922 INFO L226 Difference]: Without dead ends: 264 [2024-11-13 14:42:20,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2024-11-13 14:42:20,923 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 231 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:20,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1501 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-13 14:42:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-13 14:42:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 212. [2024-11-13 14:42:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 168 states have (on average 1.2619047619047619) internal successors, (212), 168 states have internal predecessors, (212), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:42:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 292 transitions. [2024-11-13 14:42:20,950 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 292 transitions. Word has length 172 [2024-11-13 14:42:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:20,951 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 292 transitions. [2024-11-13 14:42:20,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-13 14:42:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 292 transitions. [2024-11-13 14:42:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 14:42:20,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:20,953 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:20,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-13 14:42:21,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 14:42:21,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:21,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:21,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash 958760771, now seen corresponding path program 1 times [2024-11-13 14:42:21,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974735941] [2024-11-13 14:42:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:21,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:21,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:21,361 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:21,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-13 14:42:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:21,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:42:21,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-13 14:42:21,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:21,756 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974735941] [2024-11-13 14:42:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974735941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:21,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:21,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:42:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584515113] [2024-11-13 14:42:21,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:21,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:42:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:21,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:42:21,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:42:21,757 INFO L87 Difference]: Start difference. First operand 212 states and 292 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:42:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:21,832 INFO L93 Difference]: Finished difference Result 421 states and 581 transitions. [2024-11-13 14:42:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:42:21,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2024-11-13 14:42:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:21,835 INFO L225 Difference]: With dead ends: 421 [2024-11-13 14:42:21,835 INFO L226 Difference]: Without dead ends: 212 [2024-11-13 14:42:21,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:42:21,836 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:21,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:42:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-13 14:42:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-13 14:42:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 168 states have (on average 1.255952380952381) internal successors, (211), 168 states have internal predecessors, (211), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:42:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 291 transitions. [2024-11-13 14:42:21,859 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 291 transitions. Word has length 172 [2024-11-13 14:42:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:21,860 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 291 transitions. [2024-11-13 14:42:21,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 14:42:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 291 transitions. [2024-11-13 14:42:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-13 14:42:21,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:21,862 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:21,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-13 14:42:22,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:22,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:22,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1204872900, now seen corresponding path program 1 times [2024-11-13 14:42:22,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665949004] [2024-11-13 14:42:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:22,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:22,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:22,069 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:22,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-13 14:42:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:22,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 14:42:22,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:22,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:42:23,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:23,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:23,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:23,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:24,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-13 14:42:24,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:24,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2024-11-13 14:42:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-13 14:42:24,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:42:24,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:24,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665949004] [2024-11-13 14:42:24,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665949004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:42:24,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340694297] [2024-11-13 14:42:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:24,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:24,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:42:24,891 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:42:24,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 14:42:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 14:42:25,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:25,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:26,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:26,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:26,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-13 14:42:27,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-13 14:42:27,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:27,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2024-11-13 14:42:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-13 14:42:27,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:42:27,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340694297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:42:27,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:42:27,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 12 [2024-11-13 14:42:27,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483891188] [2024-11-13 14:42:27,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:42:27,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:42:27,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:27,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:42:27,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:42:27,468 INFO L87 Difference]: Start difference. First operand 212 states and 291 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-13 14:42:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:32,913 INFO L93 Difference]: Finished difference Result 471 states and 639 transitions. [2024-11-13 14:42:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 14:42:32,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 174 [2024-11-13 14:42:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:32,917 INFO L225 Difference]: With dead ends: 471 [2024-11-13 14:42:32,917 INFO L226 Difference]: Without dead ends: 262 [2024-11-13 14:42:32,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2024-11-13 14:42:32,919 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 335 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:32,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 983 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-13 14:42:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-13 14:42:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 214. [2024-11-13 14:42:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 170 states have internal predecessors, (214), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:42:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 294 transitions. [2024-11-13 14:42:32,942 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 294 transitions. Word has length 174 [2024-11-13 14:42:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:32,946 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 294 transitions. [2024-11-13 14:42:32,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-13 14:42:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 294 transitions. [2024-11-13 14:42:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-13 14:42:32,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:32,948 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:32,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 14:42:33,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-13 14:42:33,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:33,349 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:33,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1681914708, now seen corresponding path program 1 times [2024-11-13 14:42:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:33,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295172764] [2024-11-13 14:42:33,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:33,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:33,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:33,352 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:33,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-13 14:42:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:33,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:42:33,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:42:33,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:33,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:33,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295172764] [2024-11-13 14:42:33,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295172764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:33,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:33,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:42:33,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103276551] [2024-11-13 14:42:33,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:33,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:42:33,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:33,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:42:33,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:42:33,801 INFO L87 Difference]: Start difference. First operand 214 states and 294 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:33,879 INFO L93 Difference]: Finished difference Result 428 states and 589 transitions. [2024-11-13 14:42:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:42:33,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2024-11-13 14:42:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:33,882 INFO L225 Difference]: With dead ends: 428 [2024-11-13 14:42:33,882 INFO L226 Difference]: Without dead ends: 217 [2024-11-13 14:42:33,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:42:33,884 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:33,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:42:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-13 14:42:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-13 14:42:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 173 states have (on average 1.254335260115607) internal successors, (217), 173 states have internal predecessors, (217), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:42:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 297 transitions. [2024-11-13 14:42:33,910 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 297 transitions. Word has length 174 [2024-11-13 14:42:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:33,911 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 297 transitions. [2024-11-13 14:42:33,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 297 transitions. [2024-11-13 14:42:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-13 14:42:33,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:33,914 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:33,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-13 14:42:34,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:34,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:34,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1481683751, now seen corresponding path program 1 times [2024-11-13 14:42:34,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276410824] [2024-11-13 14:42:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:34,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:34,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:34,119 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:34,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-13 14:42:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:34,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 14:42:34,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:34,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:42:35,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:35,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:35,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:35,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:36,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2024-11-13 14:42:36,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:36,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2024-11-13 14:42:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-13 14:42:36,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:42:36,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:36,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276410824] [2024-11-13 14:42:36,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276410824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:42:36,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190120887] [2024-11-13 14:42:36,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:36,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:36,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:42:36,821 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:42:36,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 14:42:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:37,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 14:42:37,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:37,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:38,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:38,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:38,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:39,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2024-11-13 14:42:39,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:39,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2024-11-13 14:42:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 209 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-13 14:42:39,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:42:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190120887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:42:39,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:42:39,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 14 [2024-11-13 14:42:39,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735219967] [2024-11-13 14:42:39,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:42:39,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 14:42:39,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 14:42:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:42:39,402 INFO L87 Difference]: Start difference. First operand 217 states and 297 transitions. Second operand has 15 states, 14 states have (on average 5.785714285714286) internal successors, (81), 13 states have internal predecessors, (81), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-13 14:42:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:45,346 INFO L93 Difference]: Finished difference Result 585 states and 789 transitions. [2024-11-13 14:42:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 14:42:45,347 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.785714285714286) internal successors, (81), 13 states have internal predecessors, (81), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 174 [2024-11-13 14:42:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:45,350 INFO L225 Difference]: With dead ends: 585 [2024-11-13 14:42:45,350 INFO L226 Difference]: Without dead ends: 371 [2024-11-13 14:42:45,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 14:42:45,352 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 293 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:45,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1257 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-13 14:42:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-13 14:42:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 300. [2024-11-13 14:42:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 235 states have (on average 1.251063829787234) internal successors, (294), 235 states have internal predecessors, (294), 59 states have call successors, (59), 5 states have call predecessors, (59), 5 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-13 14:42:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 412 transitions. [2024-11-13 14:42:45,406 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 412 transitions. Word has length 174 [2024-11-13 14:42:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:45,407 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 412 transitions. [2024-11-13 14:42:45,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.785714285714286) internal successors, (81), 13 states have internal predecessors, (81), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-13 14:42:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 412 transitions. [2024-11-13 14:42:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-13 14:42:45,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:45,409 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:45,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 14:42:45,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-13 14:42:45,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:45,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:45,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:45,811 INFO L85 PathProgramCache]: Analyzing trace with hash 870414693, now seen corresponding path program 1 times [2024-11-13 14:42:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:45,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649091149] [2024-11-13 14:42:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:45,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:45,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:45,813 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:45,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-13 14:42:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:46,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:42:46,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-13 14:42:46,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:46,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:46,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649091149] [2024-11-13 14:42:46,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649091149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:46,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:46,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:42:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099004139] [2024-11-13 14:42:46,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:46,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:42:46,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:42:46,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:42:46,249 INFO L87 Difference]: Start difference. First operand 300 states and 412 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-13 14:42:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:46,529 INFO L93 Difference]: Finished difference Result 530 states and 721 transitions. [2024-11-13 14:42:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:42:46,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 174 [2024-11-13 14:42:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:46,532 INFO L225 Difference]: With dead ends: 530 [2024-11-13 14:42:46,532 INFO L226 Difference]: Without dead ends: 227 [2024-11-13 14:42:46,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:42:46,536 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:46,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 636 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:42:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-13 14:42:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2024-11-13 14:42:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 176 states have (on average 1.2443181818181819) internal successors, (219), 176 states have internal predecessors, (219), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:42:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 299 transitions. [2024-11-13 14:42:46,557 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 299 transitions. Word has length 174 [2024-11-13 14:42:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:46,557 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 299 transitions. [2024-11-13 14:42:46,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-13 14:42:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2024-11-13 14:42:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 14:42:46,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:46,559 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:46,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-13 14:42:46,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:46,760 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:46,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:46,760 INFO L85 PathProgramCache]: Analyzing trace with hash 990849503, now seen corresponding path program 1 times [2024-11-13 14:42:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:46,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492188865] [2024-11-13 14:42:46,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:46,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:46,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:46,763 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:46,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-13 14:42:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:47,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 14:42:47,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:47,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-13 14:42:47,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2024-11-13 14:42:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:42:47,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:47,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492188865] [2024-11-13 14:42:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492188865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:47,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:47,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:42:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317561755] [2024-11-13 14:42:47,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:47,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:42:47,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:47,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:42:47,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:42:47,357 INFO L87 Difference]: Start difference. First operand 221 states and 299 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:47,807 INFO L93 Difference]: Finished difference Result 383 states and 521 transitions. [2024-11-13 14:42:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:42:47,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-13 14:42:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:47,812 INFO L225 Difference]: With dead ends: 383 [2024-11-13 14:42:47,812 INFO L226 Difference]: Without dead ends: 381 [2024-11-13 14:42:47,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:42:47,813 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 130 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:47,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1052 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:42:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-13 14:42:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 224. [2024-11-13 14:42:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.2402234636871508) internal successors, (222), 179 states have internal predecessors, (222), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:42:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 302 transitions. [2024-11-13 14:42:47,849 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 302 transitions. Word has length 176 [2024-11-13 14:42:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:47,851 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 302 transitions. [2024-11-13 14:42:47,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 302 transitions. [2024-11-13 14:42:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 14:42:47,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:47,853 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:47,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-13 14:42:48,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:48,054 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:48,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash 992696545, now seen corresponding path program 1 times [2024-11-13 14:42:48,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509386995] [2024-11-13 14:42:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:48,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:48,056 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:48,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-13 14:42:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 14:42:48,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:48,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:42:48,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-13 14:42:48,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-13 14:42:48,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:48,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-13 14:42:49,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:49,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2024-11-13 14:42:49,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-13 14:42:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-13 14:42:49,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:49,391 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509386995] [2024-11-13 14:42:49,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509386995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:49,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:49,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:42:49,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661958492] [2024-11-13 14:42:49,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:49,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:42:49,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:49,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:42:49,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:42:49,393 INFO L87 Difference]: Start difference. First operand 224 states and 302 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-13 14:42:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:50,182 INFO L93 Difference]: Finished difference Result 562 states and 758 transitions. [2024-11-13 14:42:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:42:50,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 176 [2024-11-13 14:42:50,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:50,186 INFO L225 Difference]: With dead ends: 562 [2024-11-13 14:42:50,186 INFO L226 Difference]: Without dead ends: 341 [2024-11-13 14:42:50,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:42:50,188 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 277 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:50,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 655 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:42:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-13 14:42:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2024-11-13 14:42:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 266 states have (on average 1.2330827067669172) internal successors, (328), 268 states have internal predecessors, (328), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:42:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 456 transitions. [2024-11-13 14:42:50,240 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 456 transitions. Word has length 176 [2024-11-13 14:42:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:50,241 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 456 transitions. [2024-11-13 14:42:50,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-13 14:42:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 456 transitions. [2024-11-13 14:42:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 14:42:50,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:50,243 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:50,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-13 14:42:50,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:50,444 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:50,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:50,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1527263389, now seen corresponding path program 1 times [2024-11-13 14:42:50,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:50,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790120610] [2024-11-13 14:42:50,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:50,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:50,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:50,446 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:50,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-13 14:42:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:51,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:42:51,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:51,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-13 14:42:51,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-13 14:42:51,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:51,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-13 14:42:51,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:51,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 40 [2024-11-13 14:42:51,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-13 14:42:51,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2024-11-13 14:42:51,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:51,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2024-11-13 14:42:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-13 14:42:51,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:51,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790120610] [2024-11-13 14:42:51,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790120610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:51,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:51,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:42:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845893772] [2024-11-13 14:42:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:51,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:42:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:51,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:42:51,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:42:51,772 INFO L87 Difference]: Start difference. First operand 339 states and 456 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-13 14:42:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:52,486 INFO L93 Difference]: Finished difference Result 586 states and 780 transitions. [2024-11-13 14:42:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:42:52,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 176 [2024-11-13 14:42:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:52,489 INFO L225 Difference]: With dead ends: 586 [2024-11-13 14:42:52,490 INFO L226 Difference]: Without dead ends: 357 [2024-11-13 14:42:52,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:42:52,491 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 254 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:52,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 666 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:42:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-13 14:42:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2024-11-13 14:42:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 276 states have (on average 1.2210144927536233) internal successors, (337), 278 states have internal predecessors, (337), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 14:42:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 473 transitions. [2024-11-13 14:42:52,557 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 473 transitions. Word has length 176 [2024-11-13 14:42:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:52,557 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 473 transitions. [2024-11-13 14:42:52,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-13 14:42:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 473 transitions. [2024-11-13 14:42:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 14:42:52,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:52,559 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:52,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-13 14:42:52,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:52,763 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:52,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash -847205019, now seen corresponding path program 1 times [2024-11-13 14:42:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:52,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680966987] [2024-11-13 14:42:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:52,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:52,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:52,768 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:52,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-13 14:42:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:53,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:42:53,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:53,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:42:53,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-13 14:42:54,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:54,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2024-11-13 14:42:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-13 14:42:54,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:42:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:42:54,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680966987] [2024-11-13 14:42:54,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680966987] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:42:54,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:42:54,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-13 14:42:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132587336] [2024-11-13 14:42:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:54,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:42:54,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:42:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:42:54,284 INFO L87 Difference]: Start difference. First operand 355 states and 473 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:54,515 INFO L93 Difference]: Finished difference Result 651 states and 854 transitions. [2024-11-13 14:42:54,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:42:54,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-13 14:42:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:54,524 INFO L225 Difference]: With dead ends: 651 [2024-11-13 14:42:54,524 INFO L226 Difference]: Without dead ends: 414 [2024-11-13 14:42:54,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:42:54,525 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 38 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:54,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 778 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:42:54,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-13 14:42:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 388. [2024-11-13 14:42:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 309 states have (on average 1.233009708737864) internal successors, (381), 311 states have internal predecessors, (381), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 14:42:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 517 transitions. [2024-11-13 14:42:54,593 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 517 transitions. Word has length 176 [2024-11-13 14:42:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:54,594 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 517 transitions. [2024-11-13 14:42:54,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 517 transitions. [2024-11-13 14:42:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 14:42:54,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:54,596 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:54,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-13 14:42:54,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:54,797 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:54,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1105370457, now seen corresponding path program 1 times [2024-11-13 14:42:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477067831] [2024-11-13 14:42:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:54,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:54,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:54,801 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:54,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-13 14:42:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:55,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 14:42:55,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:55,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2024-11-13 14:42:55,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:42:55,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:42:55,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 34 [2024-11-13 14:42:55,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-11-13 14:42:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 14:42:55,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:42:55,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:42:55,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477067831] [2024-11-13 14:42:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477067831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:55,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:42:55,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722421903] [2024-11-13 14:42:55,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:55,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:42:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:42:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:42:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:42:55,815 INFO L87 Difference]: Start difference. First operand 388 states and 517 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:57,348 INFO L93 Difference]: Finished difference Result 629 states and 827 transitions. [2024-11-13 14:42:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:42:57,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-13 14:42:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:57,358 INFO L225 Difference]: With dead ends: 629 [2024-11-13 14:42:57,358 INFO L226 Difference]: Without dead ends: 359 [2024-11-13 14:42:57,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:42:57,360 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 95 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:57,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 672 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:42:57,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-13 14:42:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-11-13 14:42:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 278 states have (on average 1.2050359712230216) internal successors, (335), 280 states have internal predecessors, (335), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 14:42:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 471 transitions. [2024-11-13 14:42:57,433 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 471 transitions. Word has length 176 [2024-11-13 14:42:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:57,433 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 471 transitions. [2024-11-13 14:42:57,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 14:42:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 471 transitions. [2024-11-13 14:42:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 14:42:57,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:57,435 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:57,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-13 14:42:57,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:57,639 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:57,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash -842234590, now seen corresponding path program 1 times [2024-11-13 14:42:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:42:57,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171536883] [2024-11-13 14:42:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:57,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:42:57,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:42:57,642 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:42:57,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-13 14:42:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 14:42:58,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:58,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:42:58,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:58,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:58,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:42:59,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:43:00,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2024-11-13 14:43:00,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:43:00,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2024-11-13 14:43:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-13 14:43:00,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:43:00,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:00,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171536883] [2024-11-13 14:43:00,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171536883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:43:00,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741577850] [2024-11-13 14:43:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:00,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:00,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:00,820 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:00,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-13 14:43:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:01,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 14:43:01,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:03,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-13 14:43:04,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:43:04,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 50 [2024-11-13 14:43:05,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:43:05,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 50 [2024-11-13 14:43:05,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:43:05,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 50 [2024-11-13 14:43:07,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:43:07,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 83 [2024-11-13 14:43:07,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:43:07,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 221 treesize of output 89 [2024-11-13 14:43:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 25 proven. 270 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-11-13 14:43:07,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:43:07,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741577850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:43:07,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:43:07,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 25] total 33 [2024-11-13 14:43:07,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904127182] [2024-11-13 14:43:07,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:43:07,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 14:43:07,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:07,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 14:43:07,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 14:43:07,565 INFO L87 Difference]: Start difference. First operand 359 states and 471 transitions. Second operand has 34 states, 31 states have (on average 4.580645161290323) internal successors, (142), 29 states have internal predecessors, (142), 6 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (41), 4 states have call predecessors, (41), 6 states have call successors, (41) [2024-11-13 14:43:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:43:24,657 INFO L93 Difference]: Finished difference Result 871 states and 1104 transitions. [2024-11-13 14:43:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 14:43:24,662 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 4.580645161290323) internal successors, (142), 29 states have internal predecessors, (142), 6 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (41), 4 states have call predecessors, (41), 6 states have call successors, (41) Word has length 176 [2024-11-13 14:43:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:43:24,666 INFO L225 Difference]: With dead ends: 871 [2024-11-13 14:43:24,666 INFO L226 Difference]: Without dead ends: 630 [2024-11-13 14:43:24,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=800, Invalid=4456, Unknown=0, NotChecked=0, Total=5256 [2024-11-13 14:43:24,669 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 765 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:43:24,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 2085 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-13 14:43:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-13 14:43:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 464. [2024-11-13 14:43:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 347 states have (on average 1.1902017291066282) internal successors, (413), 352 states have internal predecessors, (413), 98 states have call successors, (98), 18 states have call predecessors, (98), 18 states have return successors, (98), 93 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-13 14:43:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 609 transitions. [2024-11-13 14:43:24,788 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 609 transitions. Word has length 176 [2024-11-13 14:43:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:43:24,789 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 609 transitions. [2024-11-13 14:43:24,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 4.580645161290323) internal successors, (142), 29 states have internal predecessors, (142), 6 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (41), 4 states have call predecessors, (41), 6 states have call successors, (41) [2024-11-13 14:43:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 609 transitions. [2024-11-13 14:43:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 14:43:24,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:43:24,791 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:24,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-13 14:43:25,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-13 14:43:25,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:25,192 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:43:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1873648759, now seen corresponding path program 1 times [2024-11-13 14:43:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53544871] [2024-11-13 14:43:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:25,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:43:25,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:43:25,195 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:43:25,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-13 14:43:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:25,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:43:25,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:26,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-13 14:43:26,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:43:26,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-13 14:43:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-13 14:43:26,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:43:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 14:43:27,381 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:27,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53544871] [2024-11-13 14:43:27,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53544871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:43:27,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:43:27,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-13 14:43:27,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746322963] [2024-11-13 14:43:27,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:43:27,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:43:27,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:27,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:43:27,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:43:27,384 INFO L87 Difference]: Start difference. First operand 464 states and 609 transitions. Second operand has 13 states, 11 states have (on average 8.545454545454545) internal successors, (94), 13 states have internal predecessors, (94), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-13 14:43:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:43:29,388 INFO L93 Difference]: Finished difference Result 826 states and 1066 transitions. [2024-11-13 14:43:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 14:43:29,389 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.545454545454545) internal successors, (94), 13 states have internal predecessors, (94), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) Word has length 178 [2024-11-13 14:43:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:43:29,391 INFO L225 Difference]: With dead ends: 826 [2024-11-13 14:43:29,391 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 14:43:29,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:43:29,396 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 170 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:43:29,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1090 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 14:43:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 14:43:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 14:43:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:43:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 14:43:29,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2024-11-13 14:43:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:43:29,399 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 14:43:29,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.545454545454545) internal successors, (94), 13 states have internal predecessors, (94), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-13 14:43:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 14:43:29,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 14:43:29,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:43:29,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-13 14:43:29,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:43:29,611 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:29,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 14:43:40,574 WARN L286 SmtUtils]: Spent 7.53s on a formula simplification. DAG size of input: 538 DAG size of output: 90 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 14:43:56,899 WARN L286 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 484 DAG size of output: 94 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 14:44:00,917 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:44:00,934 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 14:44:00,935 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 14:44:00,935 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-13 14:44:00,936 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,937 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,937 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,937 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,937 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 14:44:00,937 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 14:44:00,937 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-11-13 14:44:00,937 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,938 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-13 14:44:00,939 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-13 14:44:00,962 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,962 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,962 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,962 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 14:44:00,962 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 14:44:00,962 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-11-13 14:44:00,962 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-13 14:44:00,963 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-13 14:44:00,964 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 14:44:00,965 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-13 14:44:00,965 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-13 14:44:00,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:44:00 BoogieIcfgContainer [2024-11-13 14:44:00,977 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:44:00,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:44:00,978 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:44:00,978 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:44:00,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:53" (3/4) ... [2024-11-13 14:44:00,981 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 14:44:00,989 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-13 14:44:01,004 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-13 14:44:01,004 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 14:44:01,005 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 14:44:01,006 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 14:44:01,172 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:44:01,173 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 14:44:01,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:44:01,174 INFO L158 Benchmark]: Toolchain (without parser) took 131188.23ms. Allocated memory was 109.1MB in the beginning and 335.5MB in the end (delta: 226.5MB). Free memory was 85.2MB in the beginning and 286.8MB in the end (delta: -201.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-13 14:44:01,174 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 83.9MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:44:01,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.42ms. Allocated memory is still 109.1MB. Free memory was 85.0MB in the beginning and 67.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:44:01,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.45ms. Allocated memory is still 109.1MB. Free memory was 67.5MB in the beginning and 63.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:44:01,175 INFO L158 Benchmark]: Boogie Preprocessor took 120.15ms. Allocated memory is still 109.1MB. Free memory was 63.9MB in the beginning and 58.9MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:44:01,175 INFO L158 Benchmark]: RCFGBuilder took 2378.48ms. Allocated memory is still 109.1MB. Free memory was 58.9MB in the beginning and 64.9MB in the end (delta: -6.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-13 14:44:01,176 INFO L158 Benchmark]: TraceAbstraction took 127862.14ms. Allocated memory was 109.1MB in the beginning and 335.5MB in the end (delta: 226.5MB). Free memory was 64.3MB in the beginning and 295.2MB in the end (delta: -230.9MB). Peak memory consumption was 184.7MB. Max. memory is 16.1GB. [2024-11-13 14:44:01,176 INFO L158 Benchmark]: Witness Printer took 195.47ms. Allocated memory is still 335.5MB. Free memory was 295.2MB in the beginning and 286.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:44:01,178 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.48ms. Allocated memory is still 83.9MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.42ms. Allocated memory is still 109.1MB. Free memory was 85.0MB in the beginning and 67.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.45ms. Allocated memory is still 109.1MB. Free memory was 67.5MB in the beginning and 63.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 120.15ms. Allocated memory is still 109.1MB. Free memory was 63.9MB in the beginning and 58.9MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2378.48ms. Allocated memory is still 109.1MB. Free memory was 58.9MB in the beginning and 64.9MB in the end (delta: -6.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 127862.14ms. Allocated memory was 109.1MB in the beginning and 335.5MB in the end (delta: 226.5MB). Free memory was 64.3MB in the beginning and 295.2MB in the end (delta: -230.9MB). Peak memory consumption was 184.7MB. Max. memory is 16.1GB. * Witness Printer took 195.47ms. Allocated memory is still 335.5MB. Free memory was 295.2MB in the beginning and 286.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 96.4s, OverallIterations: 22, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 47.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3205 SdHoareTripleChecker+Valid, 37.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3104 mSDsluCounter, 18181 SdHoareTripleChecker+Invalid, 35.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14599 mSDsCounter, 588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7681 IncrementalHoareTripleChecker+Invalid, 8269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 588 mSolverCounterUnsat, 3582 mSDtfsCounter, 7681 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5312 GetRequests, 5011 SyntacticMatches, 6 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1985 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=464occurred in iteration=21, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 662 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 29.0s InterpolantComputationTime, 4486 NumberOfCodeBlocks, 4486 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4979 ConstructedInterpolants, 123 QuantifiedInterpolants, 75027 SizeOfPredicates, 88 NumberOfNonLiveVariables, 9598 ConjunctsInSsa, 379 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 22570/24360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((isInitial == \old(isInitial)) && (BOOL_unsigned_char_Array_0 == \old(BOOL_unsigned_char_Array_0))) && (float_Array_0 == \old(float_Array_0))) && (signed_long_int_Array_0 == \old(signed_long_int_Array_0))) && (unsigned_char_Array_0 == \old(unsigned_char_Array_0))) && (unsigned_long_int_Array_0 == \old(unsigned_long_int_Array_0))) && (last_1_unsigned_char_Array_0_0__1_ == \old(last_1_unsigned_char_Array_0_0__1_)))) RESULT: Ultimate proved your program to be correct! [2024-11-13 14:44:01,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29552114-3308-40d9-828c-fdadb302340d/bin/uautomizer-verify-qhAvR1uOyd/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 Writing output log to file Ultimate.log Result: TRUE