./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:06:32,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:06:32,918 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:06:32,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:06:32,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:06:32,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:06:32,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:06:32,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:06:32,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:06:32,967 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:06:32,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:06:32,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:06:32,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:06:32,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:06:32,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:06:32,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:06:32,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:06:32,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:06:32,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:06:32,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:06:32,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:06:32,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:06:32,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:06:32,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:06:32,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:06:32,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:06:32,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:06:32,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:06:32,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:06:32,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:06:32,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:06:32,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:06:32,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:06:32,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:06:32,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:06:32,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:06:32,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:06:32,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:06:32,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:06:32,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:06:32,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:06:32,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:06:32,973 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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 -> 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c [2024-11-13 15:06:33,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:06:33,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:06:33,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:06:33,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:06:33,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:06:33,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i Unable to find full path for "g++" [2024-11-13 15:06:35,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:06:35,499 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:06:35,500 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i [2024-11-13 15:06:35,509 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/data/e8c94eb7a/ce7065f080b346b595783fc6d8ca8574/FLAGc6b4fc86a [2024-11-13 15:06:35,792 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/data/e8c94eb7a/ce7065f080b346b595783fc6d8ca8574 [2024-11-13 15:06:35,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:06:35,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:06:35,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:06:35,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:06:35,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:06:35,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:06:35" (1/1) ... [2024-11-13 15:06:35,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd10caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:35, skipping insertion in model container [2024-11-13 15:06:35,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:06:35" (1/1) ... [2024-11-13 15:06:35,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:06:36,007 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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i[916,929] [2024-11-13 15:06:36,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:06:36,091 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:06:36,101 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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i[916,929] [2024-11-13 15:06:36,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:06:36,173 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:06:36,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36 WrapperNode [2024-11-13 15:06:36,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:06:36,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:06:36,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:06:36,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:06:36,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,265 INFO L138 Inliner]: procedures = 29, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 553 [2024-11-13 15:06:36,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:06:36,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:06:36,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:06:36,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:06:36,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,303 INFO L175 MemorySlicer]: Split 142 memory accesses to 6 slices as follows [2, 14, 49, 31, 8, 38]. 35 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 5, 3, 1, 4]. The 19 writes are split as follows [0, 2, 5, 4, 3, 5]. [2024-11-13 15:06:36,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:06:36,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:06:36,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:06:36,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:06:36,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (1/1) ... [2024-11-13 15:06:36,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:06:36,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:36,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:06:36,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:06:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:06:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 15:06:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 15:06:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 15:06:36,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 15:06:36,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 15:06:36,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 15:06:36,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:06:36,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:06:36,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 15:06:36,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 15:06:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 15:06:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 15:06:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 15:06:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 15:06:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 15:06:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 15:06:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 15:06:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 15:06:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:06:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:06:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 15:06:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 15:06:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 15:06:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 15:06:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 15:06:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 15:06:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 15:06:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 15:06:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 15:06:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 15:06:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:06:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:06:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:06:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:06:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:06:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 15:06:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 15:06:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 15:06:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:06:36,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:06:36,708 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:06:36,711 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:06:37,576 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-13 15:06:37,580 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:06:37,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:06:37,605 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:06:37,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:06:37 BoogieIcfgContainer [2024-11-13 15:06:37,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:06:37,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:06:37,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:06:37,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:06:37,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:06:35" (1/3) ... [2024-11-13 15:06:37,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6a751d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:06:37, skipping insertion in model container [2024-11-13 15:06:37,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:36" (2/3) ... [2024-11-13 15:06:37,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6a751d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:06:37, skipping insertion in model container [2024-11-13 15:06:37,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:06:37" (3/3) ... [2024-11-13 15:06:37,619 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-81.i [2024-11-13 15:06:37,639 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:06:37,641 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-81.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:06:37,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:06:37,742 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;@224921fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:06:37,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:06:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 109 states have internal predecessors, (156), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 15:06:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 15:06:37,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:37,764 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:37,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:06:37,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1883514271, now seen corresponding path program 1 times [2024-11-13 15:06:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82659536] [2024-11-13 15:06:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:06:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:06:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:06:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:06:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:06:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:06:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 15:06:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:06:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:06:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:06:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:06:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:06:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:06:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:06:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:06:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:06:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:06:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:06:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:06:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82659536] [2024-11-13 15:06:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82659536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:38,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:06:38,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929307649] [2024-11-13 15:06:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:38,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:06:38,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:38,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:06:38,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:06:38,436 INFO L87 Difference]: Start difference. First operand has 129 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 109 states have internal predecessors, (156), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:06:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:38,472 INFO L93 Difference]: Finished difference Result 251 states and 396 transitions. [2024-11-13 15:06:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:06:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2024-11-13 15:06:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:38,487 INFO L225 Difference]: With dead ends: 251 [2024-11-13 15:06:38,487 INFO L226 Difference]: Without dead ends: 125 [2024-11-13 15:06:38,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 15:06:38,494 INFO L432 NwaCegarLoop]: 183 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, 183 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 15:06:38,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:06:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-13 15:06:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-13 15:06:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 15:06:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2024-11-13 15:06:38,542 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 148 [2024-11-13 15:06:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:38,542 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2024-11-13 15:06:38,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:06:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2024-11-13 15:06:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 15:06:38,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:38,546 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:38,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:06:38,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:06:38,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash -879842629, now seen corresponding path program 1 times [2024-11-13 15:06:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:38,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729577124] [2024-11-13 15:06:38,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:06:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:06:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:06:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:06:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:06:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:06:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 15:06:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:06:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:06:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:06:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:06:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:06:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:06:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:06:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:06:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:06:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:06:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:06:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:06:39,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:39,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729577124] [2024-11-13 15:06:39,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729577124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:39,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:39,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:39,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350711822] [2024-11-13 15:06:39,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:39,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:39,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:39,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:39,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:39,420 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:06:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:39,594 INFO L93 Difference]: Finished difference Result 328 states and 484 transitions. [2024-11-13 15:06:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:06:39,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-13 15:06:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:39,598 INFO L225 Difference]: With dead ends: 328 [2024-11-13 15:06:39,598 INFO L226 Difference]: Without dead ends: 206 [2024-11-13 15:06:39,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:39,600 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 114 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:39,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 347 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:06:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-13 15:06:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 191. [2024-11-13 15:06:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.361842105263158) internal successors, (207), 152 states have internal predecessors, (207), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 15:06:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2024-11-13 15:06:39,651 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 148 [2024-11-13 15:06:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:39,652 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2024-11-13 15:06:39,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:06:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2024-11-13 15:06:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 15:06:39,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:39,658 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:39,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:06:39,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:06:39,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:39,659 INFO L85 PathProgramCache]: Analyzing trace with hash 389838789, now seen corresponding path program 1 times [2024-11-13 15:06:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:39,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979181485] [2024-11-13 15:06:39,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:39,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:06:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:06:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:06:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:06:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:06:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:06:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 15:06:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:06:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:06:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:06:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:06:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:06:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:06:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:06:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:06:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:06:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:06:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:06:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:06:40,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:40,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979181485] [2024-11-13 15:06:40,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979181485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:40,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:40,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:40,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942873677] [2024-11-13 15:06:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:40,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:40,249 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:06:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:40,333 INFO L93 Difference]: Finished difference Result 315 states and 462 transitions. [2024-11-13 15:06:40,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:06:40,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-13 15:06:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:40,337 INFO L225 Difference]: With dead ends: 315 [2024-11-13 15:06:40,337 INFO L226 Difference]: Without dead ends: 193 [2024-11-13 15:06:40,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:40,341 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:40,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:06:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-13 15:06:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-13 15:06:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 15:06:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 281 transitions. [2024-11-13 15:06:40,384 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 281 transitions. Word has length 149 [2024-11-13 15:06:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:40,385 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 281 transitions. [2024-11-13 15:06:40,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:06:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 281 transitions. [2024-11-13 15:06:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:06:40,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:40,390 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:40,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:06:40,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:06:40,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1043900128, now seen corresponding path program 1 times [2024-11-13 15:06:40,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:40,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348847204] [2024-11-13 15:06:40,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:40,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:06:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:06:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:06:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:06:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:06:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:06:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 15:06:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:06:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:06:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:06:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:06:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:06:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:06:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:06:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:06:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:06:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:06:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:06:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:06:40,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348847204] [2024-11-13 15:06:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348847204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:40,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:40,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:06:40,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849233499] [2024-11-13 15:06:40,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:40,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:06:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:40,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:06:40,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:06:40,962 INFO L87 Difference]: Start difference. First operand 193 states and 281 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:06:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:41,266 INFO L93 Difference]: Finished difference Result 376 states and 548 transitions. [2024-11-13 15:06:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:06:41,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-11-13 15:06:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:41,270 INFO L225 Difference]: With dead ends: 376 [2024-11-13 15:06:41,270 INFO L226 Difference]: Without dead ends: 252 [2024-11-13 15:06:41,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:06:41,276 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 178 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:41,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 482 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:06:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-13 15:06:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 222. [2024-11-13 15:06:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 183 states have (on average 1.3715846994535519) internal successors, (251), 183 states have internal predecessors, (251), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 15:06:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2024-11-13 15:06:41,332 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 151 [2024-11-13 15:06:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:41,334 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2024-11-13 15:06:41,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:06:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2024-11-13 15:06:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:06:41,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:41,339 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:41,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:06:41,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:06:41,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash 62466013, now seen corresponding path program 1 times [2024-11-13 15:06:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922659309] [2024-11-13 15:06:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:06:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:06:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:06:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:06:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:06:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:06:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 15:06:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:06:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:06:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:06:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:06:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:06:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:06:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:06:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:06:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:06:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:06:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:06:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:06:42,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:42,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922659309] [2024-11-13 15:06:42,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922659309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:42,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:42,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:06:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715018770] [2024-11-13 15:06:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:06:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:06:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:06:42,270 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:06:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:42,459 INFO L93 Difference]: Finished difference Result 447 states and 644 transitions. [2024-11-13 15:06:42,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:06:42,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-13 15:06:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:42,462 INFO L225 Difference]: With dead ends: 447 [2024-11-13 15:06:42,462 INFO L226 Difference]: Without dead ends: 313 [2024-11-13 15:06:42,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:06:42,465 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 79 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:42,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1036 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:06:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-13 15:06:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2024-11-13 15:06:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 267 states have (on average 1.3782771535580525) internal successors, (368), 268 states have internal predecessors, (368), 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 15:06:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2024-11-13 15:06:42,493 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 153 [2024-11-13 15:06:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:42,494 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2024-11-13 15:06:42,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:06:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2024-11-13 15:06:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:06:42,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:42,496 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:06:42,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:06:42,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:42,496 INFO L85 PathProgramCache]: Analyzing trace with hash 281320731, now seen corresponding path program 1 times [2024-11-13 15:06:42,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:42,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113359195] [2024-11-13 15:06:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:06:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:06:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:06:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:06:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:06:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:06:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 15:06:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:06:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:06:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:06:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:06:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:06:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:06:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:06:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:06:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:06:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:06:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:06:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:06:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113359195] [2024-11-13 15:06:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113359195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:43,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:43,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:06:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837760199] [2024-11-13 15:06:43,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:43,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:06:43,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:06:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:06:43,235 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:06:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:43,426 INFO L93 Difference]: Finished difference Result 579 states and 829 transitions. [2024-11-13 15:06:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:06:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-13 15:06:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:43,432 INFO L225 Difference]: With dead ends: 579 [2024-11-13 15:06:43,434 INFO L226 Difference]: Without dead ends: 389 [2024-11-13 15:06:43,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:06:43,436 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 71 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:43,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1006 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:06:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-13 15:06:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 342. [2024-11-13 15:06:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 299 states have (on average 1.3846153846153846) internal successors, (414), 300 states have internal predecessors, (414), 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 15:06:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 490 transitions. [2024-11-13 15:06:43,483 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 490 transitions. Word has length 153 [2024-11-13 15:06:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:43,484 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 490 transitions. [2024-11-13 15:06:43,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:06:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 490 transitions. [2024-11-13 15:06:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-13 15:06:43,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:43,488 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:43,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:06:43,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:06:43,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:43,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1164188318, now seen corresponding path program 1 times [2024-11-13 15:06:43,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:43,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940245319] [2024-11-13 15:06:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:06:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:06:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:06:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:06:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:06:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:06:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 15:06:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:06:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:06:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:06:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:06:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:06:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:06:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:06:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 15:06:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 15:06:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-13 15:06:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-13 15:06:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:06:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:06:44,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:06:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940245319] [2024-11-13 15:06:44,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940245319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:06:44,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:06:44,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:06:44,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383125603] [2024-11-13 15:06:44,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:06:44,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:06:44,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:06:44,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:06:44,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:06:44,203 INFO L87 Difference]: Start difference. First operand 342 states and 490 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:06:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:06:44,373 INFO L93 Difference]: Finished difference Result 647 states and 920 transitions. [2024-11-13 15:06:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:06:44,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 154 [2024-11-13 15:06:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:06:44,379 INFO L225 Difference]: With dead ends: 647 [2024-11-13 15:06:44,379 INFO L226 Difference]: Without dead ends: 441 [2024-11-13 15:06:44,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:06:44,383 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 110 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:06:44,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 784 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:06:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-13 15:06:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 342. [2024-11-13 15:06:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 299 states have (on average 1.3846153846153846) internal successors, (414), 300 states have internal predecessors, (414), 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 15:06:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 490 transitions. [2024-11-13 15:06:44,433 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 490 transitions. Word has length 154 [2024-11-13 15:06:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:06:44,433 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 490 transitions. [2024-11-13 15:06:44,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:06:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 490 transitions. [2024-11-13 15:06:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 15:06:44,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:06:44,436 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:06:44,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:06:44,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:06:44,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:06:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2135412086, now seen corresponding path program 1 times [2024-11-13 15:06:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:06:44,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475965544] [2024-11-13 15:06:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:06:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:06:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:06:44,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:06:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:06:44,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:06:44,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:06:44,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:06:44,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:06:44,809 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:06:44,916 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:06:44,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:06:44 BoogieIcfgContainer [2024-11-13 15:06:44,919 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:06:44,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:06:44,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:06:44,920 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:06:44,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:06:37" (3/4) ... [2024-11-13 15:06:44,923 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:06:44,924 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:06:44,925 INFO L158 Benchmark]: Toolchain (without parser) took 9128.43ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 119.1MB in the beginning and 310.7MB in the end (delta: -191.6MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2024-11-13 15:06:44,925 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:06:44,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.85ms. Allocated memory is still 142.6MB. Free memory was 118.8MB in the beginning and 103.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:06:44,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.16ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 98.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:06:44,930 INFO L158 Benchmark]: Boogie Preprocessor took 116.43ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 93.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:06:44,931 INFO L158 Benchmark]: RCFGBuilder took 1223.20ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 109.2MB in the end (delta: -15.3MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-11-13 15:06:44,931 INFO L158 Benchmark]: TraceAbstraction took 7309.49ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 108.6MB in the beginning and 310.8MB in the end (delta: -202.2MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2024-11-13 15:06:44,931 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 427.8MB. Free memory was 310.8MB in the beginning and 310.7MB in the end (delta: 54.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:06:44,933 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.43ms. Allocated memory is still 142.6MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.85ms. Allocated memory is still 142.6MB. Free memory was 118.8MB in the beginning and 103.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.16ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 98.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 116.43ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 93.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1223.20ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 109.2MB in the end (delta: -15.3MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7309.49ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 108.6MB in the beginning and 310.8MB in the end (delta: -202.2MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 427.8MB. Free memory was 310.8MB in the beginning and 310.7MB in the end (delta: 54.6kB). 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 someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of bitwiseOr at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -8 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -8 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -8; [L38] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] EXPR signed_long_int_Array_0[0] [L102] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L103] EXPR unsigned_short_int_Array_0[0][0] [L103] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] double_Array_0[0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] double_Array_0[1] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] double_Array_0[2] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[2] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L82] EXPR double_Array_0[2] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] double_Array_0[3] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L98] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L114] RET updateVariables() [L115] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_)); VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-25, unsigned_short_int_Array_0={8:0}] [L43] EXPR last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-25, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE stepLocal_0 != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_) [L44] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] COND TRUE BOOL_unsigned_char_Array_0[1] [L45] EXPR signed_char_Array_0[2] [L45] EXPR signed_char_Array_0[0] [L45] signed_char_Array_0[1] = (signed_char_Array_0[2] + signed_char_Array_0[0]) [L50] EXPR signed_char_Array_0[2] [L50] EXPR signed_char_Array_0[1] [L50] unsigned char stepLocal_1 = signed_char_Array_0[2] >= signed_char_Array_0[1]; [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] [L51] EXPR BOOL_unsigned_char_Array_0[0] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0]) [L54] EXPR unsigned_short_int_Array_0[1][0] [L54] EXPR unsigned_short_int_Array_0[0][1] [L54] unsigned_short_int_Array_0[0][0] = ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]) [L56] EXPR signed_char_Array_0[1] [L56] signed char stepLocal_2 = signed_char_Array_0[1]; [L57] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(stepLocal_2 > unsigned_short_int_Array_0[1][0]) [L64] EXPR unsigned_short_int_Array_0[1][1] [L64] signed_long_int_Array_0[0] = unsigned_short_int_Array_0[1][1] [L66] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] COND TRUE BOOL_unsigned_char_Array_0[1] [L67] EXPR double_Array_0[3] [L67] EXPR double_Array_0[2] [L67] EXPR double_Array_0[1] [L67] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) [L67] EXPR double_Array_0[2] [L67] EXPR double_Array_0[1] [L67] EXPR double_Array_0[0] [L67] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] double_Array_0[4] = ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1 [L106] EXPR double_Array_0[4] [L106] EXPR double_Array_0[3] [L106] EXPR double_Array_0[2] [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) [L106] EXPR double_Array_0[3] [L106] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106-L107] return (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 4370 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2999 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 1371 mSDtfsCounter, 323 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 194 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1211 NumberOfCodeBlocks, 1211 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1049 ConstructedInterpolants, 0 QuantifiedInterpolants, 2254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 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 15:06:44,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:06:47,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:06:47,938 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:06:47,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:06:47,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:06:47,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:06:47,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:06:47,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:06:47,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:06:47,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:06:47,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:06:47,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:06:47,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:06:47,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:06:47,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:06:47,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:06:47,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:06:47,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:06:47,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:06:47,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:06:47,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:06:47,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:06:47,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:06:47,985 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:06:47,985 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:06:47,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:06:47,985 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:06:47,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:06:47,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:06:47,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:06:47,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:06:47,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:06:47,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:06:47,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:06:47,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:06:47,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:06:47,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:06:47,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:06:47,987 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:06:47,987 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:06:47,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:06:47,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:06:47,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:06:47,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:06:47,988 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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 -> 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c [2024-11-13 15:06:48,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:06:48,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:06:48,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:06:48,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:06:48,313 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:06:48,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i Unable to find full path for "g++" [2024-11-13 15:06:50,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:06:50,654 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:06:50,655 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i [2024-11-13 15:06:50,668 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/data/a2ff61464/fd93c052903149129c6c83de731c347e/FLAG5f59e4a29 [2024-11-13 15:06:50,927 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/data/a2ff61464/fd93c052903149129c6c83de731c347e [2024-11-13 15:06:50,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:06:50,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:06:50,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:06:50,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:06:50,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:06:50,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:06:50" (1/1) ... [2024-11-13 15:06:50,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3b3beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:50, skipping insertion in model container [2024-11-13 15:06:50,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:06:50" (1/1) ... [2024-11-13 15:06:50,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:06:51,147 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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i[916,929] [2024-11-13 15:06:51,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:06:51,295 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:06:51,307 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_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i[916,929] [2024-11-13 15:06:51,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:06:51,426 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:06:51,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51 WrapperNode [2024-11-13 15:06:51,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:06:51,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:06:51,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:06:51,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:06:51,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,525 INFO L138 Inliner]: procedures = 36, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 529 [2024-11-13 15:06:51,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:06:51,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:06:51,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:06:51,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:06:51,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,605 INFO L175 MemorySlicer]: Split 142 memory accesses to 6 slices as follows [2, 14, 49, 31, 8, 38]. 35 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 5, 3, 1, 4]. The 19 writes are split as follows [0, 2, 5, 4, 3, 5]. [2024-11-13 15:06:51,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:06:51,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:06:51,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:06:51,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:06:51,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (1/1) ... [2024-11-13 15:06:51,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:06:51,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:06:51,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:06:51,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:06:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:06:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 15:06:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 15:06:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-13 15:06:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-13 15:06:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-13 15:06:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-13 15:06:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 15:06:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 15:06:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-13 15:06:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-13 15:06:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-13 15:06:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-13 15:06:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 15:06:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 15:06:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 15:06:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 15:06:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 15:06:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 15:06:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-13 15:06:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-13 15:06:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-13 15:06:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-13 15:06:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-13 15:06:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-13 15:06:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:06:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 15:06:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 15:06:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 15:06:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 15:06:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 15:06:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 15:06:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 15:06:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 15:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 15:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 15:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 15:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-13 15:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-13 15:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-13 15:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-13 15:06:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-13 15:06:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:06:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:06:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-13 15:06:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-13 15:06:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-13 15:06:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-13 15:06:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 15:06:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 15:06:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 15:06:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 15:06:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 15:06:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 15:06:52,102 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:06:52,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:07:02,573 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2024-11-13 15:07:02,573 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:07:02,589 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:07:02,589 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:07:02,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:07:02 BoogieIcfgContainer [2024-11-13 15:07:02,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:07:02,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:07:02,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:07:02,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:07:02,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:06:50" (1/3) ... [2024-11-13 15:07:02,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b58335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:07:02, skipping insertion in model container [2024-11-13 15:07:02,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:06:51" (2/3) ... [2024-11-13 15:07:02,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b58335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:07:02, skipping insertion in model container [2024-11-13 15:07:02,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:07:02" (3/3) ... [2024-11-13 15:07:02,605 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-81.i [2024-11-13 15:07:02,648 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:07:02,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-81.i that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:07:02,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:07:02,737 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;@527b8d6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:07:02,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:07:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 100 states have (on average 1.42) internal successors, (142), 101 states have internal predecessors, (142), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 15:07:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 15:07:02,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:02,758 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:02,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:02,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1084298054, now seen corresponding path program 1 times [2024-11-13 15:07:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:02,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566070271] [2024-11-13 15:07:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:02,776 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 15:07:02,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:07:02,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:02,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:03,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:07:03,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-13 15:07:03,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:07:03,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:03,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566070271] [2024-11-13 15:07:03,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566070271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:03,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:07:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525826313] [2024-11-13 15:07:03,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:07:03,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:07:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:07:03,450 INFO L87 Difference]: Start difference. First operand has 121 states, 100 states have (on average 1.42) internal successors, (142), 101 states have internal predecessors, (142), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:07:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:03,485 INFO L93 Difference]: Finished difference Result 235 states and 368 transitions. [2024-11-13 15:07:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:07:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2024-11-13 15:07:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:03,495 INFO L225 Difference]: With dead ends: 235 [2024-11-13 15:07:03,495 INFO L226 Difference]: Without dead ends: 117 [2024-11-13 15:07:03,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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 15:07:03,503 INFO L432 NwaCegarLoop]: 169 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, 169 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 15:07:03,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:07:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-13 15:07:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-13 15:07:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 15:07:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-11-13 15:07:03,559 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 147 [2024-11-13 15:07:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:03,560 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-11-13 15:07:03,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:07:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-11-13 15:07:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 15:07:03,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:03,564 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:03,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:03,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:03,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:03,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash 73487390, now seen corresponding path program 1 times [2024-11-13 15:07:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:03,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223949345] [2024-11-13 15:07:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:03,767 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 15:07:03,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:07:03,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:03,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:04,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:07:04,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:05,762 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 33 treesize of output 15 [2024-11-13 15:07:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-13 15:07:05,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:07:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:06,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223949345] [2024-11-13 15:07:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223949345] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:07:06,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:07:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-13 15:07:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553733991] [2024-11-13 15:07:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:06,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:07:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:06,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:07:06,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:07:06,557 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:06,893 INFO L93 Difference]: Finished difference Result 288 states and 413 transitions. [2024-11-13 15:07:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:07:06,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-13 15:07:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:06,900 INFO L225 Difference]: With dead ends: 288 [2024-11-13 15:07:06,900 INFO L226 Difference]: Without dead ends: 174 [2024-11-13 15:07:06,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:07:06,903 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 140 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:06,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 558 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:07:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-13 15:07:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2024-11-13 15:07:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 148 states have (on average 1.3783783783783783) internal successors, (204), 149 states have internal predecessors, (204), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 15:07:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 244 transitions. [2024-11-13 15:07:06,936 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 244 transitions. Word has length 147 [2024-11-13 15:07:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:06,941 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 244 transitions. [2024-11-13 15:07:06,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 244 transitions. [2024-11-13 15:07:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 15:07:06,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:06,948 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:06,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:07:07,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:07,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:07,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash -744161060, now seen corresponding path program 1 times [2024-11-13 15:07:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241354324] [2024-11-13 15:07:07,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:07,151 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 15:07:07,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:07:07,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:07,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:07,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:07:07,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:07,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:07:07,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:07,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241354324] [2024-11-13 15:07:07,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241354324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:07,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:07,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:07:07,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975790862] [2024-11-13 15:07:07,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:07,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:07:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:07,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:07:07,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:07:07,582 INFO L87 Difference]: Start difference. First operand 171 states and 244 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:07,669 INFO L93 Difference]: Finished difference Result 343 states and 491 transitions. [2024-11-13 15:07:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:07:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-13 15:07:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:07,674 INFO L225 Difference]: With dead ends: 343 [2024-11-13 15:07:07,674 INFO L226 Difference]: Without dead ends: 175 [2024-11-13 15:07:07,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:07:07,677 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:07,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:07:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-13 15:07:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-11-13 15:07:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.368421052631579) internal successors, (208), 153 states have internal predecessors, (208), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 15:07:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2024-11-13 15:07:07,695 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 147 [2024-11-13 15:07:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:07,696 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2024-11-13 15:07:07,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2024-11-13 15:07:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 15:07:07,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:07,699 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:07,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 15:07:07,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:07,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:07,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash 574772759, now seen corresponding path program 1 times [2024-11-13 15:07:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:07,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244281750] [2024-11-13 15:07:07,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:07,902 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 15:07:07,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:07:07,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:07,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:08,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:07:08,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-13 15:07:09,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:07:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:10,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244281750] [2024-11-13 15:07:10,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244281750] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:07:10,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:07:10,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-13 15:07:10,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977766918] [2024-11-13 15:07:10,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:10,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:07:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:10,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:07:10,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:07:10,459 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:10,773 INFO L93 Difference]: Finished difference Result 402 states and 567 transitions. [2024-11-13 15:07:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:07:10,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-13 15:07:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:10,777 INFO L225 Difference]: With dead ends: 402 [2024-11-13 15:07:10,777 INFO L226 Difference]: Without dead ends: 230 [2024-11-13 15:07:10,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:07:10,779 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 124 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:10,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 584 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:07:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-13 15:07:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 191. [2024-11-13 15:07:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.375) internal successors, (231), 169 states have internal predecessors, (231), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 15:07:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 271 transitions. [2024-11-13 15:07:10,806 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 271 transitions. Word has length 149 [2024-11-13 15:07:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:10,807 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 271 transitions. [2024-11-13 15:07:10,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 271 transitions. [2024-11-13 15:07:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 15:07:10,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:10,812 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:10,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 15:07:11,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:11,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash 297127635, now seen corresponding path program 1 times [2024-11-13 15:07:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952789730] [2024-11-13 15:07:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:11,015 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 15:07:11,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:07:11,016 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:11,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:11,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:07:11,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:11,635 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 17 treesize of output 9 [2024-11-13 15:07:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-13 15:07:13,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:07:13,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:13,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952789730] [2024-11-13 15:07:13,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952789730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:13,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:13,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:07:13,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103954246] [2024-11-13 15:07:13,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:13,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:07:13,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:07:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:07:13,899 INFO L87 Difference]: Start difference. First operand 191 states and 271 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:15,424 INFO L93 Difference]: Finished difference Result 512 states and 727 transitions. [2024-11-13 15:07:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:07:15,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-13 15:07:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:15,430 INFO L225 Difference]: With dead ends: 512 [2024-11-13 15:07:15,432 INFO L226 Difference]: Without dead ends: 324 [2024-11-13 15:07:15,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:07:15,434 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 150 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:15,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 564 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 15:07:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-13 15:07:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 299. [2024-11-13 15:07:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.359375) internal successors, (348), 257 states have internal predecessors, (348), 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 15:07:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 424 transitions. [2024-11-13 15:07:15,491 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 424 transitions. Word has length 150 [2024-11-13 15:07:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:15,493 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 424 transitions. [2024-11-13 15:07:15,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-13 15:07:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 424 transitions. [2024-11-13 15:07:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:07:15,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:15,497 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:15,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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)] Forceful destruction successful, exit code 0 [2024-11-13 15:07:15,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:15,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:15,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1145804050, now seen corresponding path program 1 times [2024-11-13 15:07:15,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:15,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974101747] [2024-11-13 15:07:15,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:15,699 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 15:07:15,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:07:15,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:15,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:16,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:07:16,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:16,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:07:16,926 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 155 treesize of output 65 [2024-11-13 15:07:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-13 15:07:17,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:07:17,014 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:17,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974101747] [2024-11-13 15:07:17,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974101747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:17,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:17,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:07:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430597864] [2024-11-13 15:07:17,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:17,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:07:17,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:07:17,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:07:17,017 INFO L87 Difference]: Start difference. First operand 299 states and 424 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:07:21,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:26,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:30,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:32,230 INFO L93 Difference]: Finished difference Result 578 states and 822 transitions. [2024-11-13 15:07:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:07:32,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2024-11-13 15:07:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:32,241 INFO L225 Difference]: With dead ends: 578 [2024-11-13 15:07:32,242 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 15:07:32,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 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 15:07:32,247 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 149 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:32,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 519 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 2 Unknown, 0 Unchecked, 15.1s Time] [2024-11-13 15:07:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 15:07:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2024-11-13 15:07:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.3515625) internal successors, (346), 257 states have internal predecessors, (346), 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 15:07:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 422 transitions. [2024-11-13 15:07:32,293 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 422 transitions. Word has length 151 [2024-11-13 15:07:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:32,293 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 422 transitions. [2024-11-13 15:07:32,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:07:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 422 transitions. [2024-11-13 15:07:32,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:07:32,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:32,296 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:32,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 15:07:32,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:32,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:32,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1681229460, now seen corresponding path program 1 times [2024-11-13 15:07:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604462936] [2024-11-13 15:07:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:32,497 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 15:07:32,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:07:32,500 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:32,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:33,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:07:33,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:33,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:07:33,675 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 175 treesize of output 67 [2024-11-13 15:07:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-13 15:07:33,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:07:33,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:33,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604462936] [2024-11-13 15:07:33,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604462936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:33,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:33,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:07:33,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957787378] [2024-11-13 15:07:33,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:33,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:07:33,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:07:33,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:07:33,772 INFO L87 Difference]: Start difference. First operand 299 states and 422 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:07:39,428 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 15:07:42,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:46,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:07:47,375 INFO L93 Difference]: Finished difference Result 571 states and 808 transitions. [2024-11-13 15:07:47,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:07:47,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-13 15:07:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:07:47,383 INFO L225 Difference]: With dead ends: 571 [2024-11-13 15:07:47,383 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 15:07:47,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:07:47,385 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 139 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:07:47,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 515 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 13.4s Time] [2024-11-13 15:07:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 15:07:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2024-11-13 15:07:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.34375) internal successors, (344), 257 states have internal predecessors, (344), 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 15:07:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 420 transitions. [2024-11-13 15:07:47,407 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 420 transitions. Word has length 153 [2024-11-13 15:07:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:07:47,407 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 420 transitions. [2024-11-13 15:07:47,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:07:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 420 transitions. [2024-11-13 15:07:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 15:07:47,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:07:47,409 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:07:47,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-13 15:07:47,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:47,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:07:47,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:07:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash -588135086, now seen corresponding path program 1 times [2024-11-13 15:07:47,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:07:47,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724468450] [2024-11-13 15:07:47,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:07:47,611 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 15:07:47,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:07:47,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:47,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:07:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:07:48,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:07:48,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:07:49,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:07:49,005 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 173 treesize of output 65 [2024-11-13 15:07:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-13 15:07:49,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:07:49,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:07:49,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724468450] [2024-11-13 15:07:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724468450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:07:49,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:07:49,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:07:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103602173] [2024-11-13 15:07:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:07:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:07:49,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:07:49,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:07:49,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:07:49,089 INFO L87 Difference]: Start difference. First operand 299 states and 420 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:07:54,480 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 15:07:57,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:59,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:00,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:03,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:08:04,676 INFO L93 Difference]: Finished difference Result 564 states and 794 transitions. [2024-11-13 15:08:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:08:04,685 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2024-11-13 15:08:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:08:04,687 INFO L225 Difference]: With dead ends: 564 [2024-11-13 15:08:04,688 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 15:08:04,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 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 15:08:04,689 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 130 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:08:04,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 511 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 15.4s Time] [2024-11-13 15:08:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 15:08:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2024-11-13 15:08:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.3359375) internal successors, (342), 257 states have internal predecessors, (342), 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 15:08:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 418 transitions. [2024-11-13 15:08:04,713 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 418 transitions. Word has length 155 [2024-11-13 15:08:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:08:04,714 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 418 transitions. [2024-11-13 15:08:04,714 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-13 15:08:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 418 transitions. [2024-11-13 15:08:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 15:08:04,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:08:04,717 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:08:04,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:08:04,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:08:04,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:08:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:08:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash 749719468, now seen corresponding path program 1 times [2024-11-13 15:08:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:08:04,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009094243] [2024-11-13 15:08:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:08:04,920 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 15:08:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:08:04,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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 15:08:04,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f3bb57c-2edf-40cb-810f-d5dcf47ffbb0/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