./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:34:46,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:34:46,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:34:46,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:34:46,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:34:46,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:34:46,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:34:46,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:34:46,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:34:46,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:34:46,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:34:46,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:34:46,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:34:46,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:34:46,284 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:34:46,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:34:46,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:34:46,285 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:34:46,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:34:46,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:34:46,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:34:46,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:34:46,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:34:46,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:34:46,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:34:46,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:34:46,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:34:46,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:34:46,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:34:46,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:34:46,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:34:46,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:34:46,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:34:46,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:34:46,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:34:46,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:34:46,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:34:46,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:34:46,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:34:46,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:34:46,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:34:46,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:34:46,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 [2024-11-09 01:34:46,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:34:46,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:34:46,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:34:46,594 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:34:46,595 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:34:46,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2024-11-09 01:34:48,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:34:48,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:34:48,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2024-11-09 01:34:48,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45214626b/4c4157c8b43f4dd0a40cd10c6684818e/FLAG1317a1e0a [2024-11-09 01:34:48,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45214626b/4c4157c8b43f4dd0a40cd10c6684818e [2024-11-09 01:34:48,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:34:48,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:34:48,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:34:48,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:34:48,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:34:48,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:34:48" (1/1) ... [2024-11-09 01:34:48,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723566fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:48, skipping insertion in model container [2024-11-09 01:34:48,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:34:48" (1/1) ... [2024-11-09 01:34:48,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:34:48,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i[916,929] [2024-11-09 01:34:48,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:34:48,935 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:34:48,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i[916,929] [2024-11-09 01:34:48,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:34:49,013 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:34:49,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49 WrapperNode [2024-11-09 01:34:49,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:34:49,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:34:49,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:34:49,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:34:49,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,103 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-09 01:34:49,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:34:49,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:34:49,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:34:49,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:34:49,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,147 INFO L175 MemorySlicer]: Split 134 memory accesses to 7 slices as follows [2, 22, 17, 32, 9, 9, 43]. 32 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 1, 3]. The 19 writes are split as follows [0, 3, 3, 6, 2, 1, 4]. [2024-11-09 01:34:49,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:34:49,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:34:49,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:34:49,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:34:49,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (1/1) ... [2024-11-09 01:34:49,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:34:49,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:34:49,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:34:49,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:34:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:34:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:34:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:34:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:34:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:34:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:34:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:34:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:34:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:34:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:34:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:34:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:34:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:34:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:34:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:34:49,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:34:49,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:34:49,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:34:49,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:34:49,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:34:49,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:34:49,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:34:49,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:34:49,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:34:49,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:34:49,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:34:49,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:34:49,320 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:34:49,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:34:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:34:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:34:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:34:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:34:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:34:49,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:34:49,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:34:49,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:34:49,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:34:49,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:34:49,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:34:50,047 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-09 01:34:50,047 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:34:50,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:34:50,068 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:34:50,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:34:50 BoogieIcfgContainer [2024-11-09 01:34:50,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:34:50,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:34:50,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:34:50,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:34:50,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:34:48" (1/3) ... [2024-11-09 01:34:50,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3996c002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:34:50, skipping insertion in model container [2024-11-09 01:34:50,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:34:49" (2/3) ... [2024-11-09 01:34:50,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3996c002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:34:50, skipping insertion in model container [2024-11-09 01:34:50,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:34:50" (3/3) ... [2024-11-09 01:34:50,080 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-73.i [2024-11-09 01:34:50,095 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:34:50,096 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:34:50,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:34:50,164 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;@33b75364, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:34:50,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:34:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:34:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:34:50,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:50,181 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:50,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:50,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash -804784601, now seen corresponding path program 1 times [2024-11-09 01:34:50,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:50,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084414025] [2024-11-09 01:34:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:34:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:34:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:34:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:34:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:34:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:34:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:34:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:34:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:34:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084414025] [2024-11-09 01:34:50,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084414025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:50,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:50,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:34:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987555756] [2024-11-09 01:34:50,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:50,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:34:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:34:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:34:50,706 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:34:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:50,745 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-09 01:34:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:34:50,748 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-09 01:34:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:50,758 INFO L225 Difference]: With dead ends: 213 [2024-11-09 01:34:50,759 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:34:50,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-09 01:34:50,768 INFO L432 NwaCegarLoop]: 155 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, 155 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-09 01:34:50,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:34:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 01:34:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:34:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-09 01:34:50,819 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-09 01:34:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:50,820 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-09 01:34:50,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:34:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-09 01:34:50,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:34:50,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:50,823 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:50,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:34:50,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:50,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 573426281, now seen corresponding path program 1 times [2024-11-09 01:34:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999681859] [2024-11-09 01:34:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:34:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:34:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:34:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:34:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:34:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:34:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:34:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:34:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:34:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999681859] [2024-11-09 01:34:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999681859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:51,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:34:51,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666994282] [2024-11-09 01:34:51,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:51,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:51,420 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:51,481 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-09 01:34:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:34:51,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-09 01:34:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:51,485 INFO L225 Difference]: With dead ends: 211 [2024-11-09 01:34:51,486 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 01:34:51,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-09 01:34:51,489 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-09 01:34:51,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 01:34:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 01:34:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:34:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-09 01:34:51,509 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-09 01:34:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:51,512 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-09 01:34:51,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-09 01:34:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 01:34:51,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:51,516 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:51,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:34:51,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:51,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1289584124, now seen corresponding path program 1 times [2024-11-09 01:34:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:51,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299109439] [2024-11-09 01:34:51,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:34:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:34:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:34:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:34:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:34:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:34:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:34:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:34:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:34:51,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:51,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299109439] [2024-11-09 01:34:51,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299109439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:51,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:34:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956023565] [2024-11-09 01:34:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:51,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:51,772 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:51,819 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-09 01:34:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:34:51,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-09 01:34:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:51,826 INFO L225 Difference]: With dead ends: 216 [2024-11-09 01:34:51,826 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 01:34:51,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-09 01:34:51,828 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:51,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 01:34:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-09 01:34:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:34:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-09 01:34:51,838 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 131 [2024-11-09 01:34:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:51,839 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-09 01:34:51,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-09 01:34:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 01:34:51,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:51,841 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:51,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:34:51,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:51,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 485423238, now seen corresponding path program 1 times [2024-11-09 01:34:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844290629] [2024-11-09 01:34:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:34:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:34:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:34:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:34:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:34:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:34:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:34:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:34:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:34:52,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844290629] [2024-11-09 01:34:52,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844290629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:52,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:52,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:34:52,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411885273] [2024-11-09 01:34:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:52,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:34:52,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:52,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:34:52,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:34:52,752 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:53,126 INFO L93 Difference]: Finished difference Result 383 states and 557 transitions. [2024-11-09 01:34:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:34:53,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-09 01:34:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:53,129 INFO L225 Difference]: With dead ends: 383 [2024-11-09 01:34:53,129 INFO L226 Difference]: Without dead ends: 276 [2024-11-09 01:34:53,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:53,131 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 247 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:53,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 594 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:34:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-09 01:34:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 211. [2024-11-09 01:34:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 178 states have (on average 1.3876404494382022) internal successors, (247), 178 states have internal predecessors, (247), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:34:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 307 transitions. [2024-11-09 01:34:53,153 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 307 transitions. Word has length 131 [2024-11-09 01:34:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:53,153 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 307 transitions. [2024-11-09 01:34:53,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 307 transitions. [2024-11-09 01:34:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 01:34:53,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:53,158 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:53,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:34:53,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash 908125064, now seen corresponding path program 1 times [2024-11-09 01:34:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161184953] [2024-11-09 01:34:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:34:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:34:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:34:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:34:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:34:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:34:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:34:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:34:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:34:53,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:53,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161184953] [2024-11-09 01:34:53,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161184953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:53,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:53,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:34:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946048175] [2024-11-09 01:34:53,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:53,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:34:53,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:53,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:34:53,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:53,984 INFO L87 Difference]: Start difference. First operand 211 states and 307 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:54,534 INFO L93 Difference]: Finished difference Result 484 states and 704 transitions. [2024-11-09 01:34:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:34:54,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-09 01:34:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:54,537 INFO L225 Difference]: With dead ends: 484 [2024-11-09 01:34:54,537 INFO L226 Difference]: Without dead ends: 276 [2024-11-09 01:34:54,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:34:54,539 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 182 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:54,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 986 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:34:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-09 01:34:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 211. [2024-11-09 01:34:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 178 states have internal predecessors, (246), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 01:34:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 306 transitions. [2024-11-09 01:34:54,564 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 306 transitions. Word has length 131 [2024-11-09 01:34:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:54,565 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 306 transitions. [2024-11-09 01:34:54,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 306 transitions. [2024-11-09 01:34:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 01:34:54,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:54,568 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:54,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:34:54,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:54,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1106633306, now seen corresponding path program 1 times [2024-11-09 01:34:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:54,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567623196] [2024-11-09 01:34:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:34:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:34:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:34:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:34:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:34:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:34:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:34:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:34:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:34:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:34:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:34:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:34:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:34:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:34:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:34:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:34:55,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:34:55,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567623196] [2024-11-09 01:34:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567623196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:34:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877098219] [2024-11-09 01:34:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:55,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:34:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:34:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:34:55,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:34:55,412 INFO L87 Difference]: Start difference. First operand 211 states and 306 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:56,043 INFO L93 Difference]: Finished difference Result 485 states and 705 transitions. [2024-11-09 01:34:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:34:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-09 01:34:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:56,047 INFO L225 Difference]: With dead ends: 485 [2024-11-09 01:34:56,048 INFO L226 Difference]: Without dead ends: 378 [2024-11-09 01:34:56,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:34:56,051 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 228 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:56,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1101 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:34:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-09 01:34:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 312. [2024-11-09 01:34:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 263 states have (on average 1.3840304182509506) internal successors, (364), 263 states have internal predecessors, (364), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 01:34:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 454 transitions. [2024-11-09 01:34:56,091 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 454 transitions. Word has length 132 [2024-11-09 01:34:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:56,091 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 454 transitions. [2024-11-09 01:34:56,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:34:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 454 transitions. [2024-11-09 01:34:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 01:34:56,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:56,094 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:56,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:34:56,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:56,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1815326852, now seen corresponding path program 1 times [2024-11-09 01:34:56,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:34:56,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961287606] [2024-11-09 01:34:56,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:56,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:34:56,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:34:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:34:56,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:34:56,331 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:34:56,333 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:34:56,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:34:56,340 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:56,481 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:34:56,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:34:56 BoogieIcfgContainer [2024-11-09 01:34:56,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:34:56,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:34:56,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:34:56,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:34:56,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:34:50" (3/4) ... [2024-11-09 01:34:56,488 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:34:56,490 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:34:56,490 INFO L158 Benchmark]: Toolchain (without parser) took 7861.30ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 78.3MB in the beginning and 234.1MB in the end (delta: -155.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:34:56,491 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 132.1MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:34:56,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.04ms. Allocated memory is still 132.1MB. Free memory was 78.0MB in the beginning and 61.5MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:34:56,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.26ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 61.5MB in the beginning and 156.3MB in the end (delta: -94.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-09 01:34:56,492 INFO L158 Benchmark]: Boogie Preprocessor took 108.91ms. Allocated memory is still 188.7MB. Free memory was 156.3MB in the beginning and 151.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:34:56,492 INFO L158 Benchmark]: RCFGBuilder took 855.00ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 114.4MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 01:34:56,492 INFO L158 Benchmark]: TraceAbstraction took 6413.10ms. Allocated memory was 188.7MB in the beginning and 281.0MB in the end (delta: 92.3MB). Free memory was 113.3MB in the beginning and 235.2MB in the end (delta: -121.8MB). Peak memory consumption was 98.5MB. Max. memory is 16.1GB. [2024-11-09 01:34:56,493 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 281.0MB. Free memory was 235.2MB in the beginning and 234.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:34:56,494 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.22ms. Allocated memory is still 132.1MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.04ms. Allocated memory is still 132.1MB. Free memory was 78.0MB in the beginning and 61.5MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.26ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 61.5MB in the beginning and 156.3MB in the end (delta: -94.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.91ms. Allocated memory is still 188.7MB. Free memory was 156.3MB in the beginning and 151.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 855.00ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 114.4MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6413.10ms. Allocated memory was 188.7MB in the beginning and 281.0MB in the end (delta: 92.3MB). Free memory was 113.3MB in the beginning and 235.2MB in the end (delta: -121.8MB). Peak memory consumption was 98.5MB. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 281.0MB. Free memory was 235.2MB in the beginning and 234.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someUnaryDOUBLEoperation at line 26. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L25-L27] double double_Array_0[2] = { -0.41, 5.5 }; [L25-L27] double double_Array_0[2] = { -0.41, 5.5 }; [L25-L27] double double_Array_0[2] = { -0.41, 5.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -10 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -10 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -10 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -16 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -16 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L40] float last_1_float_Array_0_0_ = 15.75; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR float_Array_0[0] [L102] last_1_float_Array_0_0_ = float_Array_0[0] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L76] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] 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}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] double_Array_0[0] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] float_Array_0[1] = __VERIFIER_nondet_float() [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] float_Array_0[2] = __VERIFIER_nondet_float() [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L97] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L44] BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L44] COND FALSE !(BOOL_unsigned_char_Array_0[2]) [L47] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L47] COND FALSE !(last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) [L51] EXPR unsigned_char_Array_0[1] [L51] signed_long_int_Array_0[0] = unsigned_char_Array_0[1] [L52] EXPR signed_long_int_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L52] COND FALSE !(signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) [L63] EXPR float_Array_0[1] [L63] float_Array_0[0] = float_Array_0[1] [L65] EXPR unsigned_char_Array_0[1] [L65] EXPR unsigned_char_Array_0[1] [L65] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L65] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) [L65] EXPR unsigned_char_Array_0[1] [L65] EXPR signed_long_int_Array_0[0] [L65] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L65] signed long int stepLocal_0 = (((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))); [L66] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L66] COND TRUE unsigned_char_Array_0[1] <= stepLocal_0 [L67] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L67] COND TRUE ! BOOL_unsigned_char_Array_0[2] [L68] EXPR double_Array_0[0] [L68] double_Array_0[1] = double_Array_0[0] [L73] EXPR signed_char_Array_0[1] [L73] signed_char_Array_0[0] = signed_char_Array_0[1] [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0])) [L105] EXPR double_Array_0[1] [L105] EXPR double_Array_0[0] [L105] EXPR (! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105-L106] return (((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 658 mSDsluCounter, 3729 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2625 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1344 IncrementalHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1104 mSDtfsCounter, 1344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 197 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 1856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2520/2520 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-09 01:34:56,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:34:58,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:34:58,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:34:58,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:34:58,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:34:58,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:34:58,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:34:58,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:34:58,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:34:58,985 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:34:58,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:34:58,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:34:58,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:34:58,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:34:58,989 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:34:58,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:34:58,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:34:58,991 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:34:58,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:34:58,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:34:58,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:34:58,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:34:58,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:34:58,996 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:34:58,996 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:34:58,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:34:58,998 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:34:58,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:34:58,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:34:58,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:34:58,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:34:58,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:34:59,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:34:59,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:34:59,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:34:59,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:34:59,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:34:59,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:34:59,003 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:34:59,003 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:34:59,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:34:59,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:34:59,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:34:59,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:34:59,005 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 [2024-11-09 01:34:59,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:34:59,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:34:59,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:34:59,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:34:59,384 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:34:59,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2024-11-09 01:35:01,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:35:01,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:35:01,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2024-11-09 01:35:01,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f2f764f/9d7ed2af271d44239ef24e609ad8aaa7/FLAG28adbe5ae [2024-11-09 01:35:01,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f2f764f/9d7ed2af271d44239ef24e609ad8aaa7 [2024-11-09 01:35:01,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:35:01,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:35:01,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:01,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:35:01,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:35:01,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:01" (1/1) ... [2024-11-09 01:35:01,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abd0fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:01, skipping insertion in model container [2024-11-09 01:35:01,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:01" (1/1) ... [2024-11-09 01:35:01,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:35:01,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i[916,929] [2024-11-09 01:35:01,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:02,021 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:35:02,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i[916,929] [2024-11-09 01:35:02,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:02,108 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:35:02,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02 WrapperNode [2024-11-09 01:35:02,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:02,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:02,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:35:02,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:35:02,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,201 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-09 01:35:02,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:02,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:35:02,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:35:02,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:35:02,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,275 INFO L175 MemorySlicer]: Split 134 memory accesses to 7 slices as follows [2, 22, 17, 32, 9, 9, 43]. 32 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 1, 3]. The 19 writes are split as follows [0, 3, 3, 6, 2, 1, 4]. [2024-11-09 01:35:02,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:35:02,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:35:02,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:35:02,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:35:02,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (1/1) ... [2024-11-09 01:35:02,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:35:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:02,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:35:02,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:35:02,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:35:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:35:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:35:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:35:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:35:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:35:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-09 01:35:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-09 01:35:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:35:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:35:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:35:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:35:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:35:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-09 01:35:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-09 01:35:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:35:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:35:02,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:35:02,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:35:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:35:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:35:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:35:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:35:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:35:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:35:02,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:35:02,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:35:02,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:35:02,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:35:02,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:35:02,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:35:02,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:35:02,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:35:02,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:35:02,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:35:02,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:35:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:35:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:35:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:35:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:35:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:35:02,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:35:02,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-09 01:35:02,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:35:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:35:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:35:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:35:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:35:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:35:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:35:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:35:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:35:02,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:35:02,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:35:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:35:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:35:02,653 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:35:02,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:35:04,933 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-09 01:35:04,933 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:35:04,955 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:35:04,955 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:35:04,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:04 BoogieIcfgContainer [2024-11-09 01:35:04,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:35:04,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:35:04,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:35:04,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:35:04,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:35:01" (1/3) ... [2024-11-09 01:35:04,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f48588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:04, skipping insertion in model container [2024-11-09 01:35:04,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:02" (2/3) ... [2024-11-09 01:35:04,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f48588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:04, skipping insertion in model container [2024-11-09 01:35:04,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:04" (3/3) ... [2024-11-09 01:35:04,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-73.i [2024-11-09 01:35:04,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:35:04,985 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:35:05,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:35:05,082 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;@59f73a5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:35:05,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:35:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:35:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:35:05,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:05,106 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:05,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:05,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash -804784601, now seen corresponding path program 1 times [2024-11-09 01:35:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:05,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245678823] [2024-11-09 01:35:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:05,127 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-09 01:35:05,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:05,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:05,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:05,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:35:05,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-09 01:35:05,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:05,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:05,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245678823] [2024-11-09 01:35:05,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245678823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:05,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:05,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:35:05,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140432858] [2024-11-09 01:35:05,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:05,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:35:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:05,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:35:05,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:35:05,690 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:35:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:05,732 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-09 01:35:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:35:05,735 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-09 01:35:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:05,742 INFO L225 Difference]: With dead ends: 213 [2024-11-09 01:35:05,742 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:35:05,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-09 01:35:05,749 INFO L432 NwaCegarLoop]: 155 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, 155 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-09 01:35:05,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:35:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 01:35:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:35:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-09 01:35:05,804 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-09 01:35:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:05,804 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-09 01:35:05,805 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:35:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-09 01:35:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:35:05,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:05,809 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:05,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:06,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:06,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:06,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash 573426281, now seen corresponding path program 1 times [2024-11-09 01:35:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:06,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50640619] [2024-11-09 01:35:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:06,012 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-09 01:35:06,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:06,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:06,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:06,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:35:06,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:35:06,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:06,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:06,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50640619] [2024-11-09 01:35:06,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50640619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:06,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:06,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761923236] [2024-11-09 01:35:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:06,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:06,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:06,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:06,524 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:06,594 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-09 01:35:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-09 01:35:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:06,600 INFO L225 Difference]: With dead ends: 211 [2024-11-09 01:35:06,600 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 01:35:06,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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-09 01:35:06,604 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-09 01:35:06,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 01:35:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 01:35:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:35:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-09 01:35:06,627 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-09 01:35:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:06,631 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-09 01:35:06,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-09 01:35:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 01:35:06,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:06,637 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:06,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:35:06,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:06,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:06,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:06,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1289584124, now seen corresponding path program 1 times [2024-11-09 01:35:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:06,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964808213] [2024-11-09 01:35:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:06,840 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-09 01:35:06,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:06,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:06,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:07,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:35:07,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:35:07,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:07,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:07,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964808213] [2024-11-09 01:35:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964808213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:07,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:07,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:07,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128613324] [2024-11-09 01:35:07,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:07,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:07,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:07,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:07,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:07,264 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:07,351 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2024-11-09 01:35:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:07,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-09 01:35:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:07,355 INFO L225 Difference]: With dead ends: 218 [2024-11-09 01:35:07,357 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:35:07,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:07,359 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:07,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:35:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 01:35:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:35:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-09 01:35:07,380 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 131 [2024-11-09 01:35:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:07,380 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-09 01:35:07,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-09 01:35:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 01:35:07,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:07,382 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:07,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:07,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:07,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:07,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:07,591 INFO L85 PathProgramCache]: Analyzing trace with hash 485423238, now seen corresponding path program 1 times [2024-11-09 01:35:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:07,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414180689] [2024-11-09 01:35:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:07,592 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-09 01:35:07,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:07,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:07,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:07,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:35:07,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:08,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 01:35:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-09 01:35:08,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:08,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:08,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414180689] [2024-11-09 01:35:08,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414180689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:08,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:08,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:08,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554342409] [2024-11-09 01:35:08,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:08,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:35:08,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:08,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:35:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:08,453 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:35:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:11,606 INFO L93 Difference]: Finished difference Result 222 states and 320 transitions. [2024-11-09 01:35:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:35:11,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-09 01:35:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:11,608 INFO L225 Difference]: With dead ends: 222 [2024-11-09 01:35:11,609 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:35:11,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:35:11,611 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:11,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 488 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 01:35:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:35:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 01:35:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:35:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-09 01:35:11,622 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 131 [2024-11-09 01:35:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:11,622 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-09 01:35:11,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:35:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-09 01:35:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 01:35:11,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:11,625 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:11,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:11,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:11,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:11,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash -453192500, now seen corresponding path program 1 times [2024-11-09 01:35:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729627434] [2024-11-09 01:35:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:11,828 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-09 01:35:11,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:11,834 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:11,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:12,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:35:12,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:12,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 01:35:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-09 01:35:12,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:12,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729627434] [2024-11-09 01:35:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729627434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:12,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:12,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:12,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570878940] [2024-11-09 01:35:12,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:12,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:35:12,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:12,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:35:12,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:12,470 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:35:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:14,456 INFO L93 Difference]: Finished difference Result 222 states and 318 transitions. [2024-11-09 01:35:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:35:14,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-11-09 01:35:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:14,458 INFO L225 Difference]: With dead ends: 222 [2024-11-09 01:35:14,458 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:35:14,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:35:14,460 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 114 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:14,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 483 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 01:35:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:35:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 01:35:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:35:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2024-11-09 01:35:14,469 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 133 [2024-11-09 01:35:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:14,469 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2024-11-09 01:35:14,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:35:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2024-11-09 01:35:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:35:14,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:14,471 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:14,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:14,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:14,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:14,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 929335368, now seen corresponding path program 1 times [2024-11-09 01:35:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950478384] [2024-11-09 01:35:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:14,674 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-09 01:35:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:14,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:14,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:15,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:35:15,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:35:15,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:15,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:15,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950478384] [2024-11-09 01:35:15,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950478384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:15,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:15,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:35:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970564375] [2024-11-09 01:35:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:15,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:35:15,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:15,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:35:15,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:15,067 INFO L87 Difference]: Start difference. First operand 112 states and 159 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 01:35:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:15,272 INFO L93 Difference]: Finished difference Result 225 states and 320 transitions. [2024-11-09 01:35:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:35:15,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 135 [2024-11-09 01:35:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:15,280 INFO L225 Difference]: With dead ends: 225 [2024-11-09 01:35:15,280 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 01:35:15,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 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-09 01:35:15,281 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:15,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 633 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:35:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 01:35:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2024-11-09 01:35:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 95 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:35:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-09 01:35:15,301 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 135 [2024-11-09 01:35:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:15,301 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-09 01:35:15,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 01:35:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-09 01:35:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:35:15,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:15,307 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:15,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:15,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:15,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:15,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1896686022, now seen corresponding path program 1 times [2024-11-09 01:35:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:15,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594434794] [2024-11-09 01:35:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:15,510 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-09 01:35:15,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:15,511 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:15,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:15,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:35:15,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:15,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-09 01:35:15,946 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 36 treesize of output 18 [2024-11-09 01:35:15,953 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-09 01:35:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:35:15,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:15,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:15,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594434794] [2024-11-09 01:35:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594434794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:15,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:15,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999203037] [2024-11-09 01:35:15,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:15,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:15,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:15,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:15,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:15,997 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:16,825 INFO L93 Difference]: Finished difference Result 280 states and 396 transitions. [2024-11-09 01:35:16,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:16,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-09 01:35:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:16,827 INFO L225 Difference]: With dead ends: 280 [2024-11-09 01:35:16,827 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 01:35:16,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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-09 01:35:16,828 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 142 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:16,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 484 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:35:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 01:35:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2024-11-09 01:35:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:35:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-11-09 01:35:16,840 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 135 [2024-11-09 01:35:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:16,841 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-11-09 01:35:16,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-11-09 01:35:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:35:16,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:16,843 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:16,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:17,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:17,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1975579448, now seen corresponding path program 1 times [2024-11-09 01:35:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641703831] [2024-11-09 01:35:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:17,045 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-09 01:35:17,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:17,049 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:17,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:17,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:35:17,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:17,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-09 01:35:17,579 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 59 treesize of output 47 [2024-11-09 01:35:17,625 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 24 treesize of output 12 [2024-11-09 01:35:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:35:17,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:17,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:17,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641703831] [2024-11-09 01:35:17,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641703831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:17,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:17,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:35:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357780535] [2024-11-09 01:35:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:17,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:35:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:35:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:17,671 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:19,672 INFO L93 Difference]: Finished difference Result 280 states and 394 transitions. [2024-11-09 01:35:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:35:19,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-09 01:35:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:19,674 INFO L225 Difference]: With dead ends: 280 [2024-11-09 01:35:19,674 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 01:35:19,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:35:19,675 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 140 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:19,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 727 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 01:35:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 01:35:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2024-11-09 01:35:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:35:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2024-11-09 01:35:19,690 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 135 [2024-11-09 01:35:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:19,691 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2024-11-09 01:35:19,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2024-11-09 01:35:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:35:19,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:19,695 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:19,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:19,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:19,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1680167100, now seen corresponding path program 1 times [2024-11-09 01:35:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:19,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769334170] [2024-11-09 01:35:19,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:19,897 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-09 01:35:19,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:19,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:19,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 01:35:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:20,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 01:35:20,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:20,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:35:21,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:21,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 98 [2024-11-09 01:35:22,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:22,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 368 treesize of output 134 [2024-11-09 01:35:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-09 01:35:22,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:22,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:22,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769334170] [2024-11-09 01:35:22,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769334170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:22,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [681277339] [2024-11-09 01:35:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:22,739 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:35:22,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:35:22,742 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:35:22,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-09 01:35:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:24,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 01:35:24,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:24,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 01:35:27,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:27,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 100 [2024-11-09 01:35:28,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:28,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 299 treesize of output 151 [2024-11-09 01:35:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-09 01:35:28,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [681277339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:28,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:35:28,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-09 01:35:28,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519449743] [2024-11-09 01:35:28,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:35:28,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:35:28,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:28,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:35:28,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:35:28,265 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-09 01:35:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:38,058 INFO L93 Difference]: Finished difference Result 343 states and 478 transitions. [2024-11-09 01:35:38,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:35:38,059 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 136 [2024-11-09 01:35:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:38,061 INFO L225 Difference]: With dead ends: 343 [2024-11-09 01:35:38,061 INFO L226 Difference]: Without dead ends: 234 [2024-11-09 01:35:38,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2024-11-09 01:35:38,062 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 259 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:38,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 2015 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-09 01:35:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-09 01:35:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2024-11-09 01:35:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.3138297872340425) internal successors, (247), 190 states have internal predecessors, (247), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:35:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 319 transitions. [2024-11-09 01:35:38,096 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 319 transitions. Word has length 136 [2024-11-09 01:35:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:38,096 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 319 transitions. [2024-11-09 01:35:38,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-09 01:35:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 319 transitions. [2024-11-09 01:35:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:35:38,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:38,100 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:38,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-09 01:35:38,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:38,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:38,501 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:38,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash -328781882, now seen corresponding path program 1 times [2024-11-09 01:35:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636933941] [2024-11-09 01:35:38,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:38,503 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-09 01:35:38,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:38,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:38,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 01:35:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:38,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:35:38,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-09 01:35:38,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:38,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:38,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636933941] [2024-11-09 01:35:38,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636933941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:38,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:38,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800997120] [2024-11-09 01:35:38,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:38,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:38,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:38,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:38,843 INFO L87 Difference]: Start difference. First operand 228 states and 319 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:35:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:38,927 INFO L93 Difference]: Finished difference Result 440 states and 616 transitions. [2024-11-09 01:35:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:38,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-09 01:35:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:38,931 INFO L225 Difference]: With dead ends: 440 [2024-11-09 01:35:38,932 INFO L226 Difference]: Without dead ends: 228 [2024-11-09 01:35:38,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 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-09 01:35:38,934 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:38,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-09 01:35:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-09 01:35:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.3085106382978724) internal successors, (246), 190 states have internal predecessors, (246), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:35:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2024-11-09 01:35:38,961 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 136 [2024-11-09 01:35:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:38,962 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2024-11-09 01:35:38,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:35:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2024-11-09 01:35:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:35:38,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:38,966 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:38,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 01:35:39,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:39,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:39,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -407899840, now seen corresponding path program 1 times [2024-11-09 01:35:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:39,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682570934] [2024-11-09 01:35:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:39,168 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-09 01:35:39,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:39,171 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:39,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 01:35:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:39,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:35:39,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 204 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-09 01:35:39,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:35:40,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:40,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682570934] [2024-11-09 01:35:40,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682570934] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:40,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:35:40,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-09 01:35:40,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342272690] [2024-11-09 01:35:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:40,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:40,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:40,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:35:40,045 INFO L87 Difference]: Start difference. First operand 228 states and 318 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:40,232 INFO L93 Difference]: Finished difference Result 560 states and 778 transitions. [2024-11-09 01:35:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:40,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2024-11-09 01:35:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:40,235 INFO L225 Difference]: With dead ends: 560 [2024-11-09 01:35:40,235 INFO L226 Difference]: Without dead ends: 348 [2024-11-09 01:35:40,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:40,236 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 126 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:40,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 421 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-09 01:35:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2024-11-09 01:35:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 298 states have internal predecessors, (389), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 01:35:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 477 transitions. [2024-11-09 01:35:40,268 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 477 transitions. Word has length 138 [2024-11-09 01:35:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:40,268 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 477 transitions. [2024-11-09 01:35:40,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 477 transitions. [2024-11-09 01:35:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:35:40,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:40,271 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:40,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:40,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:40,472 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:40,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:40,472 INFO L85 PathProgramCache]: Analyzing trace with hash 416076505, now seen corresponding path program 1 times [2024-11-09 01:35:40,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:40,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776048677] [2024-11-09 01:35:40,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:40,473 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-09 01:35:40,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:40,474 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:40,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 01:35:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:40,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:35:40,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:35:40,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:40,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:35:40,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776048677] [2024-11-09 01:35:40,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776048677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:40,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:35:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125299055] [2024-11-09 01:35:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:40,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:35:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:35:40,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:35:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:40,905 INFO L87 Difference]: Start difference. First operand 344 states and 477 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:41,004 INFO L93 Difference]: Finished difference Result 688 states and 952 transitions. [2024-11-09 01:35:41,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:35:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2024-11-09 01:35:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:41,008 INFO L225 Difference]: With dead ends: 688 [2024-11-09 01:35:41,008 INFO L226 Difference]: Without dead ends: 360 [2024-11-09 01:35:41,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:41,010 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:41,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 712 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-09 01:35:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-09 01:35:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 310 states have (on average 1.3064516129032258) internal successors, (405), 314 states have internal predecessors, (405), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 01:35:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 493 transitions. [2024-11-09 01:35:41,039 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 493 transitions. Word has length 138 [2024-11-09 01:35:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:41,042 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 493 transitions. [2024-11-09 01:35:41,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:35:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 493 transitions. [2024-11-09 01:35:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:35:41,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:41,045 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:35:41,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:41,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:41,245 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:41,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash -393190646, now seen corresponding path program 1 times [2024-11-09 01:35:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:35:41,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326120808] [2024-11-09 01:35:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:41,246 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-09 01:35:41,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:35:41,248 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 01:35:41,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 01:35:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:41,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:35:41,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:41,926 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 47 treesize of output 23 [2024-11-09 01:35:42,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:36:03,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:03,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 112