./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.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_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:18:09,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:18:09,892 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:18:09,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:18:09,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:18:09,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:18:09,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:18:09,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:18:09,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:18:09,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:18:09,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:18:09,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:18:09,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:18:09,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:18:09,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:18:09,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:18:09,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:18:09,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:18:09,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:18:09,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:18:09,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:18:09,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:18:09,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:18:09,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:18:09,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:18:09,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:18:09,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:18:09,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:18:09,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:18:09,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:18:09,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:18:09,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:18:09,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:18:09,944 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_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 -> a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 [2024-11-13 16:18:10,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:18:10,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:18:10,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:18:10,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:18:10,312 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:18:10,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i Unable to find full path for "g++" [2024-11-13 16:18:12,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:18:12,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:18:12,501 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i [2024-11-13 16:18:12,516 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/data/2f91b092c/b70e886472e7427499a52d11767a4bfd/FLAGe91b4ce41 [2024-11-13 16:18:12,747 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/data/2f91b092c/b70e886472e7427499a52d11767a4bfd [2024-11-13 16:18:12,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:18:12,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:18:12,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:18:12,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:18:12,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:18:12,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:18:12" (1/1) ... [2024-11-13 16:18:12,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d74e212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:12, skipping insertion in model container [2024-11-13 16:18:12,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:18:12" (1/1) ... [2024-11-13 16:18:12,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:18:12,918 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_c9b0de3c-0bec-4676-a74d-211a0f843d98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i[916,929] [2024-11-13 16:18:12,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:18:13,004 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:18:13,012 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_c9b0de3c-0bec-4676-a74d-211a0f843d98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i[916,929] [2024-11-13 16:18:13,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:18:13,085 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:18:13,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13 WrapperNode [2024-11-13 16:18:13,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:18:13,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:18:13,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:18:13,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:18:13,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,151 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 538 [2024-11-13 16:18:13,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:18:13,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:18:13,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:18:13,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:18:13,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,195 INFO L175 MemorySlicer]: Split 146 memory accesses to 4 slices as follows [2, 26, 51, 67]. 46 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 8]. The 18 writes are split as follows [0, 5, 5, 8]. [2024-11-13 16:18:13,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:18:13,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:18:13,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:18:13,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:18:13,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (1/1) ... [2024-11-13 16:18:13,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:18:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:18:13,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:18:13,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:18:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:18:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 16:18:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 16:18:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 16:18:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 16:18:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:18:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:18:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 16:18:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 16:18:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 16:18:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 16:18:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 16:18:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 16:18:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:18:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:18:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 16:18:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 16:18:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 16:18:13,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 16:18:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 16:18:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 16:18:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:18:13,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:18:13,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:18:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:18:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:18:13,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 16:18:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:18:13,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:18:13,470 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:18:13,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:18:14,037 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-13 16:18:14,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:18:14,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:18:14,056 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:18:14,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:18:14 BoogieIcfgContainer [2024-11-13 16:18:14,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:18:14,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:18:14,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:18:14,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:18:14,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:18:12" (1/3) ... [2024-11-13 16:18:14,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676ef717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:18:14, skipping insertion in model container [2024-11-13 16:18:14,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:13" (2/3) ... [2024-11-13 16:18:14,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676ef717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:18:14, skipping insertion in model container [2024-11-13 16:18:14,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:18:14" (3/3) ... [2024-11-13 16:18:14,068 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-23.i [2024-11-13 16:18:14,084 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:18:14,088 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-23.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:18:14,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:18:14,172 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;@422f3819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:18:14,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:18:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 16:18:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:18:14,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:14,188 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:14,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:14,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 872113410, now seen corresponding path program 1 times [2024-11-13 16:18:14,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:14,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451979700] [2024-11-13 16:18:14,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:14,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:14,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:14,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451979700] [2024-11-13 16:18:14,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451979700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:14,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:14,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:18:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20480776] [2024-11-13 16:18:14,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:14,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:18:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:18:14,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:18:14,778 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:14,819 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2024-11-13 16:18:14,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:18:14,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-13 16:18:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:14,828 INFO L225 Difference]: With dead ends: 241 [2024-11-13 16:18:14,828 INFO L226 Difference]: Without dead ends: 120 [2024-11-13 16:18:14,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:18:14,835 INFO L432 NwaCegarLoop]: 176 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, 176 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 16:18:14,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:18:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-13 16:18:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-13 16:18:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 16:18:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-13 16:18:14,880 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2024-11-13 16:18:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:14,881 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-13 16:18:14,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-13 16:18:14,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:18:14,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:14,885 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:14,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:18:14,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:14,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2113385806, now seen corresponding path program 1 times [2024-11-13 16:18:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727022982] [2024-11-13 16:18:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:18,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727022982] [2024-11-13 16:18:18,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727022982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:18,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:18,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 16:18:18,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137976755] [2024-11-13 16:18:18,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:18,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:18:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:18,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:18:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:18:18,156 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:19,463 INFO L93 Difference]: Finished difference Result 455 states and 671 transitions. [2024-11-13 16:18:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:18:19,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-13 16:18:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:19,467 INFO L225 Difference]: With dead ends: 455 [2024-11-13 16:18:19,468 INFO L226 Difference]: Without dead ends: 338 [2024-11-13 16:18:19,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:18:19,470 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 380 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:19,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1822 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 16:18:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-13 16:18:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 239. [2024-11-13 16:18:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 198 states have (on average 1.4090909090909092) internal successors, (279), 199 states have internal predecessors, (279), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 16:18:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 355 transitions. [2024-11-13 16:18:19,513 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 355 transitions. Word has length 165 [2024-11-13 16:18:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:19,514 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 355 transitions. [2024-11-13 16:18:19,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 355 transitions. [2024-11-13 16:18:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:18:19,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:19,518 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:19,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:18:19,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:19,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1526579792, now seen corresponding path program 1 times [2024-11-13 16:18:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281945517] [2024-11-13 16:18:19,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:21,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281945517] [2024-11-13 16:18:21,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281945517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:21,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:21,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:18:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557415007] [2024-11-13 16:18:21,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:21,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:18:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:21,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:18:21,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:18:21,538 INFO L87 Difference]: Start difference. First operand 239 states and 355 transitions. Second operand has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-13 16:18:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:22,703 INFO L93 Difference]: Finished difference Result 634 states and 935 transitions. [2024-11-13 16:18:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:18:22,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-13 16:18:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:22,713 INFO L225 Difference]: With dead ends: 634 [2024-11-13 16:18:22,713 INFO L226 Difference]: Without dead ends: 398 [2024-11-13 16:18:22,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:18:22,716 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 363 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:22,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1113 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 16:18:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-13 16:18:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 305. [2024-11-13 16:18:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 246 states have (on average 1.3821138211382114) internal successors, (340), 248 states have internal predecessors, (340), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 16:18:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 448 transitions. [2024-11-13 16:18:22,805 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 448 transitions. Word has length 165 [2024-11-13 16:18:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:22,807 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 448 transitions. [2024-11-13 16:18:22,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-13 16:18:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 448 transitions. [2024-11-13 16:18:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:18:22,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:22,815 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:22,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:18:22,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:22,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1295737356, now seen corresponding path program 1 times [2024-11-13 16:18:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:22,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870538140] [2024-11-13 16:18:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:24,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870538140] [2024-11-13 16:18:24,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870538140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:24,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:24,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:18:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77935484] [2024-11-13 16:18:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:24,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:18:24,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:24,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:18:24,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:18:24,336 INFO L87 Difference]: Start difference. First operand 305 states and 448 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:25,326 INFO L93 Difference]: Finished difference Result 553 states and 810 transitions. [2024-11-13 16:18:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:18:25,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-13 16:18:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:25,329 INFO L225 Difference]: With dead ends: 553 [2024-11-13 16:18:25,329 INFO L226 Difference]: Without dead ends: 313 [2024-11-13 16:18:25,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:18:25,331 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 204 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:25,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1554 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 16:18:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-13 16:18:25,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 294. [2024-11-13 16:18:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 235 states have (on average 1.374468085106383) internal successors, (323), 237 states have internal predecessors, (323), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 16:18:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 431 transitions. [2024-11-13 16:18:25,394 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 431 transitions. Word has length 165 [2024-11-13 16:18:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:25,395 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 431 transitions. [2024-11-13 16:18:25,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 431 transitions. [2024-11-13 16:18:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:18:25,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:25,399 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:25,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:18:25,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:25,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:25,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1979372300, now seen corresponding path program 1 times [2024-11-13 16:18:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:25,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265983589] [2024-11-13 16:18:25,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:25,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:26,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265983589] [2024-11-13 16:18:26,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265983589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:26,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:26,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:18:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616891373] [2024-11-13 16:18:26,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:26,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:18:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:26,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:18:26,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:18:26,506 INFO L87 Difference]: Start difference. First operand 294 states and 431 transitions. Second operand has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-13 16:18:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:27,146 INFO L93 Difference]: Finished difference Result 530 states and 772 transitions. [2024-11-13 16:18:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:18:27,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-13 16:18:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:27,150 INFO L225 Difference]: With dead ends: 530 [2024-11-13 16:18:27,153 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 16:18:27,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:18:27,154 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 143 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:27,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1292 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:18:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 16:18:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 236. [2024-11-13 16:18:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 194 states have internal predecessors, (265), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 16:18:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 341 transitions. [2024-11-13 16:18:27,217 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 341 transitions. Word has length 165 [2024-11-13 16:18:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:27,220 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 341 transitions. [2024-11-13 16:18:27,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-13 16:18:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 341 transitions. [2024-11-13 16:18:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:18:27,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:27,222 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:27,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:18:27,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:27,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1392566286, now seen corresponding path program 1 times [2024-11-13 16:18:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649531703] [2024-11-13 16:18:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:28,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:28,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649531703] [2024-11-13 16:18:28,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649531703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:28,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:28,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:18:28,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104569021] [2024-11-13 16:18:28,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:18:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:18:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:18:28,494 INFO L87 Difference]: Start difference. First operand 236 states and 341 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:29,128 INFO L93 Difference]: Finished difference Result 534 states and 773 transitions. [2024-11-13 16:18:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:18:29,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-13 16:18:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:29,132 INFO L225 Difference]: With dead ends: 534 [2024-11-13 16:18:29,134 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 16:18:29,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:18:29,136 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 142 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:29,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1722 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:18:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 16:18:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 236. [2024-11-13 16:18:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 194 states have internal predecessors, (264), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 16:18:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 340 transitions. [2024-11-13 16:18:29,207 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 340 transitions. Word has length 165 [2024-11-13 16:18:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:29,208 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 340 transitions. [2024-11-13 16:18:29,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 340 transitions. [2024-11-13 16:18:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 16:18:29,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:29,211 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:29,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:18:29,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:29,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1170263296, now seen corresponding path program 1 times [2024-11-13 16:18:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:29,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177462412] [2024-11-13 16:18:29,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:29,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:29,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:29,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177462412] [2024-11-13 16:18:29,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177462412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:29,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:29,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:18:29,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598520766] [2024-11-13 16:18:29,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:29,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:18:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:29,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:18:29,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:18:29,483 INFO L87 Difference]: Start difference. First operand 236 states and 340 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:18:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:29,570 INFO L93 Difference]: Finished difference Result 475 states and 685 transitions. [2024-11-13 16:18:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:18:29,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2024-11-13 16:18:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:29,576 INFO L225 Difference]: With dead ends: 475 [2024-11-13 16:18:29,576 INFO L226 Difference]: Without dead ends: 242 [2024-11-13 16:18:29,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 16:18:29,578 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:29,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:18:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-13 16:18:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-13 16:18:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 199 states have (on average 1.35678391959799) internal successors, (270), 200 states have internal predecessors, (270), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 16:18:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2024-11-13 16:18:29,627 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 167 [2024-11-13 16:18:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2024-11-13 16:18:29,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:18:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2024-11-13 16:18:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 16:18:29,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:29,632 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:18:29,632 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash -110250885, now seen corresponding path program 1 times [2024-11-13 16:18:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123055747] [2024-11-13 16:18:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:31,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123055747] [2024-11-13 16:18:31,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123055747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:31,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:31,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 16:18:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855134008] [2024-11-13 16:18:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:31,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 16:18:31,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:31,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 16:18:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:18:31,474 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:32,723 INFO L93 Difference]: Finished difference Result 781 states and 1116 transitions. [2024-11-13 16:18:32,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:18:32,724 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-13 16:18:32,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:32,728 INFO L225 Difference]: With dead ends: 781 [2024-11-13 16:18:32,729 INFO L226 Difference]: Without dead ends: 542 [2024-11-13 16:18:32,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-13 16:18:32,732 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 381 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:32,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1398 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 16:18:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-13 16:18:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 275. [2024-11-13 16:18:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 233 states have internal predecessors, (317), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 16:18:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 393 transitions. [2024-11-13 16:18:32,819 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 393 transitions. Word has length 169 [2024-11-13 16:18:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 393 transitions. [2024-11-13 16:18:32,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:18:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 393 transitions. [2024-11-13 16:18:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 16:18:32,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:32,826 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:32,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:18:32,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:32,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:32,827 INFO L85 PathProgramCache]: Analyzing trace with hash -503277895, now seen corresponding path program 1 times [2024-11-13 16:18:32,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359055331] [2024-11-13 16:18:32,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:35,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:35,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359055331] [2024-11-13 16:18:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359055331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 16:18:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648245766] [2024-11-13 16:18:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:35,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 16:18:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:35,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 16:18:35,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:18:35,042 INFO L87 Difference]: Start difference. First operand 275 states and 393 transitions. Second operand has 13 states, 8 states have (on average 9.0) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-13 16:18:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:36,441 INFO L93 Difference]: Finished difference Result 723 states and 1032 transitions. [2024-11-13 16:18:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:18:36,446 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 8 states have (on average 9.0) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 6 states have call successors, (20) Word has length 169 [2024-11-13 16:18:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:36,449 INFO L225 Difference]: With dead ends: 723 [2024-11-13 16:18:36,450 INFO L226 Difference]: Without dead ends: 451 [2024-11-13 16:18:36,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:18:36,453 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 305 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:36,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1837 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 16:18:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-13 16:18:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 357. [2024-11-13 16:18:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 303 states have (on average 1.3663366336633664) internal successors, (414), 305 states have internal predecessors, (414), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:18:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 510 transitions. [2024-11-13 16:18:36,554 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 510 transitions. Word has length 169 [2024-11-13 16:18:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:36,554 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 510 transitions. [2024-11-13 16:18:36,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 8 states have (on average 9.0) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-13 16:18:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 510 transitions. [2024-11-13 16:18:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 16:18:36,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:36,561 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:36,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:18:36,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:36,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1282698523, now seen corresponding path program 1 times [2024-11-13 16:18:36,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:36,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431194794] [2024-11-13 16:18:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:36,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-13 16:18:37,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:37,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431194794] [2024-11-13 16:18:37,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431194794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:18:37,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702554712] [2024-11-13 16:18:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:37,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:18:37,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:18:37,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:18:37,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:18:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:37,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 16:18:37,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:18:38,300 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 75 treesize of output 47 [2024-11-13 16:18:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-13 16:18:38,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:18:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-13 16:18:38,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702554712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:18:38,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:18:38,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-11-13 16:18:38,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230226311] [2024-11-13 16:18:38,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:18:38,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 16:18:38,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 16:18:38,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-13 16:18:38,861 INFO L87 Difference]: Start difference. First operand 357 states and 510 transitions. Second operand has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 5 states have call successors, (38) [2024-11-13 16:18:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:39,991 INFO L93 Difference]: Finished difference Result 1117 states and 1570 transitions. [2024-11-13 16:18:39,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 16:18:39,991 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 5 states have call successors, (38) Word has length 169 [2024-11-13 16:18:39,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:39,996 INFO L225 Difference]: With dead ends: 1117 [2024-11-13 16:18:39,996 INFO L226 Difference]: Without dead ends: 763 [2024-11-13 16:18:39,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2024-11-13 16:18:39,998 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 589 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:39,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1618 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 16:18:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-13 16:18:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 377. [2024-11-13 16:18:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 320 states have (on average 1.346875) internal successors, (431), 322 states have internal predecessors, (431), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:18:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 527 transitions. [2024-11-13 16:18:40,103 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 527 transitions. Word has length 169 [2024-11-13 16:18:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:40,103 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 527 transitions. [2024-11-13 16:18:40,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 5 states have call successors, (38) [2024-11-13 16:18:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 527 transitions. [2024-11-13 16:18:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 16:18:40,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:40,108 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:40,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:18:40,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 16:18:40,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:40,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:40,311 INFO L85 PathProgramCache]: Analyzing trace with hash -859996697, now seen corresponding path program 1 times [2024-11-13 16:18:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415969812] [2024-11-13 16:18:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:40,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:18:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:18:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:18:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:18:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:18:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:18:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:18:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:18:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:18:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:18:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:18:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:18:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:18:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:18:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 16:18:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 16:18:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 16:18:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 16:18:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 16:18:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 16:18:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:18:40,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:40,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415969812] [2024-11-13 16:18:40,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415969812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:40,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:18:40,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:18:40,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440135226] [2024-11-13 16:18:40,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:40,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:18:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:40,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:18:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:18:40,459 INFO L87 Difference]: Start difference. First operand 377 states and 527 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:18:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:40,568 INFO L93 Difference]: Finished difference Result 755 states and 1059 transitions. [2024-11-13 16:18:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:18:40,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-13 16:18:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:18:40,571 INFO L225 Difference]: With dead ends: 755 [2024-11-13 16:18:40,573 INFO L226 Difference]: Without dead ends: 381 [2024-11-13 16:18:40,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:18:40,575 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:18:40,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:18:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-13 16:18:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-13 16:18:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 324 states have (on average 1.3425925925925926) internal successors, (435), 326 states have internal predecessors, (435), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 16:18:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 531 transitions. [2024-11-13 16:18:40,692 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 531 transitions. Word has length 169 [2024-11-13 16:18:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:18:40,693 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 531 transitions. [2024-11-13 16:18:40,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:18:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 531 transitions. [2024-11-13 16:18:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 16:18:40,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:18:40,697 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:18:40,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:18:40,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:18:40,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash -641141979, now seen corresponding path program 1 times [2024-11-13 16:18:40,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:40,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106306237] [2024-11-13 16:18:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 16:18:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062364800] [2024-11-13 16:18:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:40,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:18:40,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:18:40,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:18:40,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:18:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:41,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:41,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:18:41,922 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:18:41,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:18:41,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 16:18:42,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 16:18:42,130 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:18:42,230 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:18:42,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:18:42 BoogieIcfgContainer [2024-11-13 16:18:42,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:18:42,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:18:42,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:18:42,234 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:18:42,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:18:14" (3/4) ... [2024-11-13 16:18:42,237 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:18:42,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:18:42,239 INFO L158 Benchmark]: Toolchain (without parser) took 29488.73ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 118.7MB in the beginning and 461.4MB in the end (delta: -342.6MB). Peak memory consumption was 146.5MB. Max. memory is 16.1GB. [2024-11-13 16:18:42,240 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 167.8MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:18:42,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 102.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:18:42,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.62ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 98.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:18:42,241 INFO L158 Benchmark]: Boogie Preprocessor took 77.96ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 94.1MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:18:42,241 INFO L158 Benchmark]: RCFGBuilder took 818.49ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 61.3MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 16:18:42,242 INFO L158 Benchmark]: TraceAbstraction took 28174.11ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 60.6MB in the beginning and 461.5MB in the end (delta: -400.9MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2024-11-13 16:18:42,242 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 629.1MB. Free memory was 461.5MB in the beginning and 461.4MB in the end (delta: 108.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:18:42,244 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.31ms. Allocated memory is still 167.8MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 102.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.62ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 98.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.96ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 94.1MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 818.49ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 61.3MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28174.11ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 60.6MB in the beginning and 461.5MB in the end (delta: -400.9MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 629.1MB. Free memory was 461.5MB in the beginning and 461.4MB in the end (delta: 108.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 35, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L54] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L55] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L55] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L55] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L57] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L58] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L58] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L58] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L60] float_Array_0[0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L62] float_Array_0[1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L64] float_Array_0[2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L66] float_Array_0[3] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[3] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F [L67] EXPR float_Array_0[3] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] EXPR float_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] CALL assume_abort_if_not(float_Array_0[3] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] RET assume_abort_if_not(float_Array_0[3] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L69] float_Array_0[4] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[4] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F [L70] EXPR float_Array_0[4] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] CALL assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] RET assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L71] unsigned_long_int_Array_0[0][0][0] = __VERIFIER_nondet_ulong() [L72] EXPR unsigned_long_int_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L72] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR unsigned_long_int_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L74] unsigned_long_int_Array_0[1][0][0] = __VERIFIER_nondet_ulong() [L75] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L77] unsigned_long_int_Array_0[1][1][0] = __VERIFIER_nondet_ulong() [L78] EXPR unsigned_long_int_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR unsigned_long_int_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L80] unsigned_long_int_Array_0[1][0][1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L83] unsigned_long_int_Array_0[0][1][1] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] EXPR unsigned_long_int_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L98] RET updateVariables() [L99] CALL step() [L34] EXPR unsigned_long_int_Array_0[0][1][1] [L34] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L34] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L34] EXPR unsigned_long_int_Array_0[0][1][1] [L34] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L34] unsigned_long_int_Array_0[1][1][1] = ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))) [L35] EXPR float_Array_0[4] [L35] EXPR float_Array_0[3] [L35] EXPR float_Array_0[2] [L35] EXPR float_Array_0[1] [L35] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L35] COND FALSE !((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) [L38] EXPR unsigned_long_int_Array_0[0][1][1] [L38] EXPR unsigned_long_int_Array_0[1][1][0] [L38] EXPR unsigned_long_int_Array_0[0][0][0] [L38] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L38] EXPR ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])) [L38] EXPR unsigned_long_int_Array_0[0][1][1] [L38] EXPR ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L38] unsigned_long_int_Array_0[0][1][0] = ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))) [L39] EXPR float_Array_0[4] [L39] unsigned char stepLocal_0 = (- float_Array_0[4]) != 1.9f; [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) [L40] EXPR unsigned_long_int_Array_0[0][0][1] [L40] EXPR unsigned_long_int_Array_0[1][0][0] [L40] EXPR unsigned_long_int_Array_0[1][0][1] [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L40] COND FALSE !(stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) [L43] EXPR BOOL_unsigned_char_Array_0[1][1] [L43] BOOL_unsigned_char_Array_0[0][1] = BOOL_unsigned_char_Array_0[1][1] [L45] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0][1]) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR unsigned_long_int_Array_0[1][1][1] [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) [L90] EXPR float_Array_0[4] [L90] EXPR float_Array_0[3] [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[1] [L90] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1 [L90] EXPR unsigned_long_int_Array_0[0][0][1] [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90-L91] return ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.0s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2560 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2507 mSDsluCounter, 13546 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11133 mSDsCounter, 323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4612 IncrementalHoareTripleChecker+Invalid, 4935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 323 mSolverCounterUnsat, 2413 mSDtfsCounter, 4612 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 965 GetRequests, 850 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=11, InterpolantAutomatonStates: 110, 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, 11 MinimizatonAttempts, 1088 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 2340 NumberOfCodeBlocks, 2340 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2158 ConstructedInterpolants, 0 QuantifiedInterpolants, 7945 SizeOfPredicates, 4 NumberOfNonLiveVariables, 550 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 9736/9880 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 16:18:42,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:18:44,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:18:44,910 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 16:18:44,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:18:44,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:18:44,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:18:44,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:18:44,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:18:44,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:18:44,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:18:44,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:18:44,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:18:44,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:18:44,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:18:44,985 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:18:44,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:18:44,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:18:44,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:18:44,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:18:44,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:18:44,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:18:44,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:18:44,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:18:44,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:18:44,987 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:18:44,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:18:44,987 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:18:44,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:18:44,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:18:44,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:18:44,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:18:44,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:18:44,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:18:44,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:18:44,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:18:44,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:18:44,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:18:44,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:18:44,989 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:18:44,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:18:44,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:18:44,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:18:44,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:18:44,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:18:44,990 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_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 -> a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 [2024-11-13 16:18:45,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:18:45,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:18:45,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:18:45,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:18:45,337 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:18:45,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i Unable to find full path for "g++" [2024-11-13 16:18:47,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:18:47,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:18:47,534 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i [2024-11-13 16:18:47,543 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/data/5c108769a/4a74a8e3f7b7405db7f18cd04892c1a5/FLAGe67d25da5 [2024-11-13 16:18:47,559 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/data/5c108769a/4a74a8e3f7b7405db7f18cd04892c1a5 [2024-11-13 16:18:47,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:18:47,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:18:47,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:18:47,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:18:47,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:18:47,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:18:47" (1/1) ... [2024-11-13 16:18:47,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a63857a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:47, skipping insertion in model container [2024-11-13 16:18:47,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:18:47" (1/1) ... [2024-11-13 16:18:47,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:18:47,781 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_c9b0de3c-0bec-4676-a74d-211a0f843d98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i[916,929] [2024-11-13 16:18:47,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:18:47,908 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:18:47,920 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_c9b0de3c-0bec-4676-a74d-211a0f843d98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i[916,929] [2024-11-13 16:18:48,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:18:48,037 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:18:48,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48 WrapperNode [2024-11-13 16:18:48,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:18:48,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:18:48,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:18:48,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:18:48,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,122 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 538 [2024-11-13 16:18:48,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:18:48,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:18:48,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:18:48,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:18:48,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,162 INFO L175 MemorySlicer]: Split 146 memory accesses to 4 slices as follows [2, 26, 51, 67]. 46 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 8]. The 18 writes are split as follows [0, 5, 5, 8]. [2024-11-13 16:18:48,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:18:48,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:18:48,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:18:48,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:18:48,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (1/1) ... [2024-11-13 16:18:48,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:18:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:18:48,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:18:48,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:18:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:18:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 16:18:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 16:18:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 16:18:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 16:18:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:18:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 16:18:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 16:18:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 16:18:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 16:18:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 16:18:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 16:18:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 16:18:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 16:18:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 16:18:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 16:18:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-13 16:18:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 16:18:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 16:18:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 16:18:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 16:18:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 16:18:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 16:18:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-13 16:18:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-13 16:18:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 16:18:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 16:18:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 16:18:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-13 16:18:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:18:48,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:18:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:18:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:18:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 16:18:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 16:18:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 16:18:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 16:18:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 16:18:48,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 16:18:48,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 16:18:48,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 16:18:48,511 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:18:48,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:19:06,478 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-13 16:19:06,482 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:19:06,499 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:19:06,500 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:19:06,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:19:06 BoogieIcfgContainer [2024-11-13 16:19:06,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:19:06,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:19:06,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:19:06,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:19:06,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:18:47" (1/3) ... [2024-11-13 16:19:06,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7e6316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:19:06, skipping insertion in model container [2024-11-13 16:19:06,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:18:48" (2/3) ... [2024-11-13 16:19:06,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7e6316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:19:06, skipping insertion in model container [2024-11-13 16:19:06,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:19:06" (3/3) ... [2024-11-13 16:19:06,513 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-23.i [2024-11-13 16:19:06,527 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:19:06,529 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-23.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:19:06,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:19:06,595 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;@27fbd303, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:19:06,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:19:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 16:19:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:19:06,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:19:06,614 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:19:06,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:19:06,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 872113410, now seen corresponding path program 1 times [2024-11-13 16:19:06,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:19:06,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415029220] [2024-11-13 16:19:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:06,632 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 16:19:06,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:19:06,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:06,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:07,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 16:19:07,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-13 16:19:07,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:19:07,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:19:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415029220] [2024-11-13 16:19:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415029220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:19:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:19:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:19:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500516138] [2024-11-13 16:19:07,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:19:07,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:19:07,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:19:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:19:07,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:19:07,554 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:19:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:19:07,590 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2024-11-13 16:19:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:19:07,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-13 16:19:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:19:07,599 INFO L225 Difference]: With dead ends: 241 [2024-11-13 16:19:07,599 INFO L226 Difference]: Without dead ends: 120 [2024-11-13 16:19:07,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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 16:19:07,606 INFO L432 NwaCegarLoop]: 176 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, 176 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 16:19:07,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:19:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-13 16:19:07,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-13 16:19:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 16:19:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-13 16:19:07,658 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2024-11-13 16:19:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:19:07,658 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-13 16:19:07,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:19:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-13 16:19:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:19:07,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:19:07,663 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:19:07,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:07,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:19:07,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2113385806, now seen corresponding path program 1 times [2024-11-13 16:19:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:19:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288039011] [2024-11-13 16:19:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:07,866 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 16:19:07,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:19:07,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:07,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:08,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 16:19:08,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:10,198 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 75 treesize of output 47 [2024-11-13 16:19:10,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:19:10,330 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 32 treesize of output 14 [2024-11-13 16:19:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-13 16:19:10,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:19:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-13 16:19:11,882 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:19:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288039011] [2024-11-13 16:19:11,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288039011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:19:11,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:19:11,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-13 16:19:11,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501632498] [2024-11-13 16:19:11,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:19:11,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 16:19:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:19:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 16:19:11,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:19:11,888 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-13 16:19:16,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:19:18,463 INFO L93 Difference]: Finished difference Result 374 states and 539 transitions. [2024-11-13 16:19:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 16:19:18,464 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) Word has length 165 [2024-11-13 16:19:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:19:18,468 INFO L225 Difference]: With dead ends: 374 [2024-11-13 16:19:18,468 INFO L226 Difference]: Without dead ends: 257 [2024-11-13 16:19:18,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2024-11-13 16:19:18,470 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 284 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:19:18,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1707 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-13 16:19:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-13 16:19:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 235. [2024-11-13 16:19:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 189 states have (on average 1.3650793650793651) internal successors, (258), 190 states have internal predecessors, (258), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 16:19:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 338 transitions. [2024-11-13 16:19:18,534 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 338 transitions. Word has length 165 [2024-11-13 16:19:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:19:18,535 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 338 transitions. [2024-11-13 16:19:18,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-13 16:19:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 338 transitions. [2024-11-13 16:19:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:19:18,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:19:18,541 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:19:18,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 16:19:18,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:18,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:19:18,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash 525037904, now seen corresponding path program 1 times [2024-11-13 16:19:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:19:18,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010300995] [2024-11-13 16:19:18,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:18,743 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 16:19:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:19:18,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:18,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:19,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:19:19,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:19:19,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:19:19,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:19:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010300995] [2024-11-13 16:19:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010300995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:19:19,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:19:19,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:19:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796774450] [2024-11-13 16:19:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:19:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:19:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:19:19,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:19:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:19:19,465 INFO L87 Difference]: Start difference. First operand 235 states and 338 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:19:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:19:19,587 INFO L93 Difference]: Finished difference Result 468 states and 675 transitions. [2024-11-13 16:19:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:19:19,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-13 16:19:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:19:19,595 INFO L225 Difference]: With dead ends: 468 [2024-11-13 16:19:19,596 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 16:19:19,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:19:19,601 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:19:19,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:19:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 16:19:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-13 16:19:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 190 states have (on average 1.3631578947368421) internal successors, (259), 191 states have internal predecessors, (259), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 16:19:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 339 transitions. [2024-11-13 16:19:19,655 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 339 transitions. Word has length 165 [2024-11-13 16:19:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:19:19,658 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 339 transitions. [2024-11-13 16:19:19,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:19:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 339 transitions. [2024-11-13 16:19:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 16:19:19,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:19:19,666 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:19:19,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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)] Forceful destruction successful, exit code 0 [2024-11-13 16:19:19,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:19,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:19:19,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1469106802, now seen corresponding path program 1 times [2024-11-13 16:19:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:19:19,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810100669] [2024-11-13 16:19:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:19,872 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 16:19:19,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:19:19,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:19,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:20,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:19:20,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:20,898 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 77 treesize of output 41 [2024-11-13 16:19:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2024-11-13 16:19:20,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:19:20,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:19:20,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810100669] [2024-11-13 16:19:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810100669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:19:20,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:19:20,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:19:20,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317043977] [2024-11-13 16:19:20,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:19:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:19:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:19:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:19:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:19:20,990 INFO L87 Difference]: Start difference. First operand 236 states and 339 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:19:24,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:26,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:27,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:29,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:30,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:32,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:34,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:19:34,563 INFO L93 Difference]: Finished difference Result 471 states and 677 transitions. [2024-11-13 16:19:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:19:34,585 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-13 16:19:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:19:34,587 INFO L225 Difference]: With dead ends: 471 [2024-11-13 16:19:34,587 INFO L226 Difference]: Without dead ends: 238 [2024-11-13 16:19:34,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:19:34,588 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 155 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:19:34,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 522 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2024-11-13 16:19:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-13 16:19:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2024-11-13 16:19:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 190 states have (on average 1.3526315789473684) internal successors, (257), 191 states have internal predecessors, (257), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 16:19:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 337 transitions. [2024-11-13 16:19:34,630 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 337 transitions. Word has length 165 [2024-11-13 16:19:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:19:34,632 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 337 transitions. [2024-11-13 16:19:34,632 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:19:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 337 transitions. [2024-11-13 16:19:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 16:19:34,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:19:34,637 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:19:34,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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)] Forceful destruction successful, exit code 0 [2024-11-13 16:19:34,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:34,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:19:34,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:34,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1468996200, now seen corresponding path program 1 times [2024-11-13 16:19:34,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:19:34,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709141493] [2024-11-13 16:19:34,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:34,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 16:19:34,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:19:34,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:34,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:35,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:19:35,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:35,895 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 16:19:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-13 16:19:35,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:19:35,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:19:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709141493] [2024-11-13 16:19:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709141493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:19:35,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:19:35,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:19:35,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120208448] [2024-11-13 16:19:35,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:19:35,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:19:35,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:19:35,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:19:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:19:35,982 INFO L87 Difference]: Start difference. First operand 236 states and 337 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:19:37,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:40,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:41,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:42,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:45,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:48,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:50,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:19:50,390 INFO L93 Difference]: Finished difference Result 471 states and 673 transitions. [2024-11-13 16:19:50,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:19:50,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2024-11-13 16:19:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:19:50,415 INFO L225 Difference]: With dead ends: 471 [2024-11-13 16:19:50,415 INFO L226 Difference]: Without dead ends: 238 [2024-11-13 16:19:50,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:19:50,417 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 147 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:19:50,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 520 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2024-11-13 16:19:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-13 16:19:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2024-11-13 16:19:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 190 states have (on average 1.3421052631578947) internal successors, (255), 191 states have internal predecessors, (255), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 16:19:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 335 transitions. [2024-11-13 16:19:50,437 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 335 transitions. Word has length 167 [2024-11-13 16:19:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:19:50,438 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 335 transitions. [2024-11-13 16:19:50,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 16:19:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 335 transitions. [2024-11-13 16:19:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 16:19:50,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:19:50,440 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:19:50,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:50,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:50,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:19:50,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:50,642 INFO L85 PathProgramCache]: Analyzing trace with hash 841234510, now seen corresponding path program 1 times [2024-11-13 16:19:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:19:50,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084481351] [2024-11-13 16:19:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:50,642 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 16:19:50,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:19:50,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:50,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:51,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 16:19:51,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:51,296 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 16:19:51,332 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 19 treesize of output 19 [2024-11-13 16:19:51,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:19:51,408 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 35 treesize of output 22 [2024-11-13 16:19:51,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:19:51,524 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 34 treesize of output 10 [2024-11-13 16:19:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:19:51,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:19:51,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:19:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084481351] [2024-11-13 16:19:51,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084481351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:19:51,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:19:51,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:19:51,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142982304] [2024-11-13 16:19:51,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:19:51,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:19:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:19:51,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:19:51,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:19:51,613 INFO L87 Difference]: Start difference. First operand 236 states and 335 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:19:52,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:56,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:57,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:19:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:19:58,283 INFO L93 Difference]: Finished difference Result 697 states and 991 transitions. [2024-11-13 16:19:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:19:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-13 16:19:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:19:58,287 INFO L225 Difference]: With dead ends: 697 [2024-11-13 16:19:58,287 INFO L226 Difference]: Without dead ends: 464 [2024-11-13 16:19:58,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:19:58,289 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 148 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:19:58,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1231 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-13 16:19:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-13 16:19:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2024-11-13 16:19:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 373 states have (on average 1.3458445040214477) internal successors, (502), 376 states have internal predecessors, (502), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 16:19:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 654 transitions. [2024-11-13 16:19:58,342 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 654 transitions. Word has length 169 [2024-11-13 16:19:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:19:58,343 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 654 transitions. [2024-11-13 16:19:58,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:19:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 654 transitions. [2024-11-13 16:19:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 16:19:58,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:19:58,347 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:19:58,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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)] Forceful destruction successful, exit code 0 [2024-11-13 16:19:58,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:58,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:19:58,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash 254428496, now seen corresponding path program 1 times [2024-11-13 16:19:58,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:19:58,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720091953] [2024-11-13 16:19:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:58,549 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 16:19:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:19:58,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:58,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:19:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:59,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:19:59,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:59,252 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 16:19:59,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:19:59,334 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 35 treesize of output 22 [2024-11-13 16:19:59,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:19:59,370 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 35 treesize of output 22 [2024-11-13 16:19:59,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:19:59,419 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 34 treesize of output 10 [2024-11-13 16:19:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:19:59,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:19:59,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:19:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720091953] [2024-11-13 16:19:59,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720091953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:19:59,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:19:59,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:19:59,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92675571] [2024-11-13 16:19:59,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:19:59,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:19:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:19:59,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:19:59,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:19:59,464 INFO L87 Difference]: Start difference. First operand 460 states and 654 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:02,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:04,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:05,315 INFO L93 Difference]: Finished difference Result 990 states and 1400 transitions. [2024-11-13 16:20:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:20:05,316 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-13 16:20:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:05,320 INFO L225 Difference]: With dead ends: 990 [2024-11-13 16:20:05,320 INFO L226 Difference]: Without dead ends: 533 [2024-11-13 16:20:05,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:20:05,322 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 142 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:20:05,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 625 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-13 16:20:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-13 16:20:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 530. [2024-11-13 16:20:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 423 states have (on average 1.326241134751773) internal successors, (561), 427 states have internal predecessors, (561), 92 states have call successors, (92), 14 states have call predecessors, (92), 14 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-13 16:20:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 745 transitions. [2024-11-13 16:20:05,368 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 745 transitions. Word has length 169 [2024-11-13 16:20:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:05,369 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 745 transitions. [2024-11-13 16:20:05,369 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 745 transitions. [2024-11-13 16:20:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 16:20:05,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:05,371 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:20:05,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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)] Forceful destruction successful, exit code 0 [2024-11-13 16:20:05,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:05,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:05,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 707221004, now seen corresponding path program 1 times [2024-11-13 16:20:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:20:05,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572833566] [2024-11-13 16:20:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:05,573 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 16:20:05,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:20:05,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:05,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:06,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:20:06,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:06,251 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 16:20:06,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:06,332 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 36 treesize of output 23 [2024-11-13 16:20:06,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:06,373 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 36 treesize of output 23 [2024-11-13 16:20:06,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:06,422 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 11 [2024-11-13 16:20:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:20:06,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:20:06,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:20:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572833566] [2024-11-13 16:20:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572833566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:20:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:20:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:20:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674202764] [2024-11-13 16:20:06,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:20:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:20:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:20:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:20:06,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:20:06,455 INFO L87 Difference]: Start difference. First operand 530 states and 745 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:08,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:11,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:11,662 INFO L93 Difference]: Finished difference Result 1002 states and 1402 transitions. [2024-11-13 16:20:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:20:11,664 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-13 16:20:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:11,668 INFO L225 Difference]: With dead ends: 1002 [2024-11-13 16:20:11,669 INFO L226 Difference]: Without dead ends: 541 [2024-11-13 16:20:11,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:20:11,671 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 141 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:20:11,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 877 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-13 16:20:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-13 16:20:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 452. [2024-11-13 16:20:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 369 states have (on average 1.3333333333333333) internal successors, (492), 372 states have internal predecessors, (492), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-13 16:20:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 632 transitions. [2024-11-13 16:20:11,735 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 632 transitions. Word has length 169 [2024-11-13 16:20:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:11,738 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 632 transitions. [2024-11-13 16:20:11,738 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 632 transitions. [2024-11-13 16:20:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 16:20:11,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:11,741 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:20:11,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:11,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:11,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:11,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:11,942 INFO L85 PathProgramCache]: Analyzing trace with hash 120414990, now seen corresponding path program 1 times [2024-11-13 16:20:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:20:11,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193410923] [2024-11-13 16:20:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:11,942 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 16:20:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:20:11,945 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:11,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:12,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 16:20:12,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:12,619 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 16:20:12,653 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 19 treesize of output 19 [2024-11-13 16:20:12,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:12,713 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 35 treesize of output 22 [2024-11-13 16:20:12,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:12,808 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 34 treesize of output 10 [2024-11-13 16:20:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:20:12,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:20:12,872 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:20:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193410923] [2024-11-13 16:20:12,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193410923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:20:12,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:20:12,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:20:12,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559934947] [2024-11-13 16:20:12,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:20:12,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:20:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:20:12,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:20:12,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:20:12,874 INFO L87 Difference]: Start difference. First operand 452 states and 632 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:15,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:18,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:19,683 INFO L93 Difference]: Finished difference Result 970 states and 1356 transitions. [2024-11-13 16:20:19,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:20:19,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-13 16:20:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:19,691 INFO L225 Difference]: With dead ends: 970 [2024-11-13 16:20:19,691 INFO L226 Difference]: Without dead ends: 521 [2024-11-13 16:20:19,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:20:19,693 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 139 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:20:19,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1476 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-13 16:20:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-13 16:20:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 452. [2024-11-13 16:20:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 372 states have internal predecessors, (490), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-13 16:20:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 630 transitions. [2024-11-13 16:20:19,759 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 630 transitions. Word has length 169 [2024-11-13 16:20:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:19,759 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 630 transitions. [2024-11-13 16:20:19,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 630 transitions. [2024-11-13 16:20:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 16:20:19,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:19,762 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:20:19,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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)] Ended with exit code 0 [2024-11-13 16:20:19,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:19,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:19,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:19,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1596420096, now seen corresponding path program 1 times [2024-11-13 16:20:19,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:20:19,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574969012] [2024-11-13 16:20:19,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:19,964 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 16:20:19,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:20:19,966 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:19,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:20,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:20:20,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:20:20,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:20:20,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:20:20,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574969012] [2024-11-13 16:20:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574969012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:20:20,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:20:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:20:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132833480] [2024-11-13 16:20:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:20:20,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:20:20,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:20:20,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:20:20,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:20:20,757 INFO L87 Difference]: Start difference. First operand 452 states and 630 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:20,882 INFO L93 Difference]: Finished difference Result 913 states and 1273 transitions. [2024-11-13 16:20:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:20:20,883 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 171 [2024-11-13 16:20:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:20,886 INFO L225 Difference]: With dead ends: 913 [2024-11-13 16:20:20,886 INFO L226 Difference]: Without dead ends: 464 [2024-11-13 16:20:20,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 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 16:20:20,888 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:20:20,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 664 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:20:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-13 16:20:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2024-11-13 16:20:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 381 states have (on average 1.3175853018372703) internal successors, (502), 384 states have internal predecessors, (502), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-13 16:20:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 642 transitions. [2024-11-13 16:20:20,939 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 642 transitions. Word has length 171 [2024-11-13 16:20:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:20,943 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 642 transitions. [2024-11-13 16:20:20,943 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 642 transitions. [2024-11-13 16:20:20,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 16:20:20,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:20,947 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:20:20,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:21,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:21,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash -308234373, now seen corresponding path program 1 times [2024-11-13 16:20:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:20:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614854095] [2024-11-13 16:20:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:21,149 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 16:20:21,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:20:21,151 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:21,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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)] Waiting until timeout for monitored process [2024-11-13 16:20:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:22,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:20:22,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:22,022 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 16:20:22,055 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 19 treesize of output 19 [2024-11-13 16:20:22,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:22,223 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 34 treesize of output 10 [2024-11-13 16:20:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:20:22,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:20:22,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:20:22,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614854095] [2024-11-13 16:20:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614854095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:20:22,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:20:22,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:20:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497551571] [2024-11-13 16:20:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:20:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:20:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:20:22,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:20:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:20:22,327 INFO L87 Difference]: Start difference. First operand 464 states and 642 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:24,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:27,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:28,253 INFO L93 Difference]: Finished difference Result 1380 states and 1909 transitions. [2024-11-13 16:20:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:20:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 173 [2024-11-13 16:20:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:28,270 INFO L225 Difference]: With dead ends: 1380 [2024-11-13 16:20:28,270 INFO L226 Difference]: Without dead ends: 919 [2024-11-13 16:20:28,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:20:28,271 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 141 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:20:28,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 914 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-13 16:20:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-13 16:20:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 526. [2024-11-13 16:20:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 443 states have (on average 1.3227990970654628) internal successors, (586), 446 states have internal predecessors, (586), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-13 16:20:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 726 transitions. [2024-11-13 16:20:28,328 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 726 transitions. Word has length 173 [2024-11-13 16:20:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:28,329 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 726 transitions. [2024-11-13 16:20:28,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 726 transitions. [2024-11-13 16:20:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 16:20:28,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:28,332 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:20:28,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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)] Ended with exit code 0 [2024-11-13 16:20:28,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:28,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:28,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:28,533 INFO L85 PathProgramCache]: Analyzing trace with hash -701261383, now seen corresponding path program 1 times [2024-11-13 16:20:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:20:28,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771792338] [2024-11-13 16:20:28,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:28,534 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 16:20:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:20:28,535 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:28,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:30,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 16:20:30,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:31,020 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 16:20:31,380 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 34 treesize of output 14 [2024-11-13 16:20:31,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2024-11-13 16:20:33,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:33,150 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 61 treesize of output 41 [2024-11-13 16:20:33,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:33,579 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 61 treesize of output 41 [2024-11-13 16:20:34,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:34,154 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 61 treesize of output 41 [2024-11-13 16:20:34,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:34,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 57 [2024-11-13 16:20:35,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:20:35,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 35 [2024-11-13 16:20:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 479 proven. 66 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-11-13 16:20:35,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:20:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 16:20:36,902 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:20:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771792338] [2024-11-13 16:20:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771792338] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 16:20:36,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:20:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2024-11-13 16:20:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965717467] [2024-11-13 16:20:36,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:20:36,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:20:36,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:20:36,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:20:36,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2024-11-13 16:20:36,905 INFO L87 Difference]: Start difference. First operand 526 states and 726 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:40,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:44,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:45,804 INFO L93 Difference]: Finished difference Result 1199 states and 1655 transitions. [2024-11-13 16:20:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:20:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 173 [2024-11-13 16:20:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:45,811 INFO L225 Difference]: With dead ends: 1199 [2024-11-13 16:20:45,811 INFO L226 Difference]: Without dead ends: 676 [2024-11-13 16:20:45,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2024-11-13 16:20:45,813 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 114 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:20:45,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 739 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2024-11-13 16:20:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-13 16:20:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 672. [2024-11-13 16:20:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 564 states have (on average 1.324468085106383) internal successors, (747), 569 states have internal predecessors, (747), 90 states have call successors, (90), 17 states have call predecessors, (90), 17 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-13 16:20:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 927 transitions. [2024-11-13 16:20:45,891 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 927 transitions. Word has length 173 [2024-11-13 16:20:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:45,892 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 927 transitions. [2024-11-13 16:20:45,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 16:20:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 927 transitions. [2024-11-13 16:20:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 16:20:45,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:45,895 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:20:45,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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)] Ended with exit code 0 [2024-11-13 16:20:46,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:46,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:46,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1480682011, now seen corresponding path program 1 times [2024-11-13 16:20:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:20:46,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530551661] [2024-11-13 16:20:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:46,097 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 16:20:46,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:20:46,100 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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 16:20:46,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9b0de3c-0bec-4676-a74d-211a0f843d98/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