./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.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-ap_file-2.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 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:38:58,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:38:58,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:38:58,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:38:58,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:38:58,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:38:58,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:38:58,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:38:58,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:38:58,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:38:58,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:38:58,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:38:58,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:38:58,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:38:58,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:38:58,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:38:58,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:38:58,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:38:58,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:38:58,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:38:58,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:38:58,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:38:58,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:38:58,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:38:58,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:38:58,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:38:58,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:38:58,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:38:58,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:38:58,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:38:58,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:38:58,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:38:58,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:38:58,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:38:58,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:38:58,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:38:58,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:38:58,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:38:58,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:38:58,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:38:58,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:38:58,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:38:58,447 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 -> 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 [2024-11-09 01:38:58,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:38:58,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:38:58,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:38:58,693 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:38:58,693 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:38:58,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-09 01:39:00,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:39:00,198 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:39:00,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-09 01:39:00,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5209cd4e/58c5572b3ddf4f48a800526e6ba30b9a/FLAG432b7081f [2024-11-09 01:39:00,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5209cd4e/58c5572b3ddf4f48a800526e6ba30b9a [2024-11-09 01:39:00,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:39:00,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:39:00,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:39:00,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:39:00,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:39:00,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20fecb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00, skipping insertion in model container [2024-11-09 01:39:00,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:39:00,414 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-ap_file-2.i[916,929] [2024-11-09 01:39:00,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:39:00,505 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:39:00,515 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-ap_file-2.i[916,929] [2024-11-09 01:39:00,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:39:00,561 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:39:00,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00 WrapperNode [2024-11-09 01:39:00,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:39:00,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:39:00,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:39:00,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:39:00,572 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:39:00" (1/1) ... [2024-11-09 01:39:00,594 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:39:00" (1/1) ... [2024-11-09 01:39:00,634 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-11-09 01:39:00,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:39:00,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:39:00,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:39:00,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:39:00,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,668 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2024-11-09 01:39:00,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:39:00,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:39:00,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:39:00,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:39:00,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (1/1) ... [2024-11-09 01:39:00,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:39:00,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:39:00,747 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:39:00,753 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:39:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:39:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:39:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:39:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:39:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:39:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:39:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:39:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:39:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:39:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:39:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:39:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:39:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:39:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:39:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:39:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:39:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:39:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:39:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:39:00,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:39:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:39:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:39:00,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:39:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:39:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:39:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:39:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:39:00,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:39:00,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:39:00,936 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:39:00,938 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:39:01,363 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-09 01:39:01,363 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:39:01,375 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:39:01,375 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:39:01,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:01 BoogieIcfgContainer [2024-11-09 01:39:01,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:39:01,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:39:01,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:39:01,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:39:01,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:39:00" (1/3) ... [2024-11-09 01:39:01,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a9d619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:39:01, skipping insertion in model container [2024-11-09 01:39:01,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:00" (2/3) ... [2024-11-09 01:39:01,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a9d619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:39:01, skipping insertion in model container [2024-11-09 01:39:01,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:01" (3/3) ... [2024-11-09 01:39:01,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-09 01:39:01,400 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:39:01,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:39:01,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:39:01,466 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;@54cc6739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:39:01,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:39:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:39:01,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:01,480 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:01,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash 717352381, now seen corresponding path program 1 times [2024-11-09 01:39:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:01,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467815610] [2024-11-09 01:39:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:01,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:01,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:01,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467815610] [2024-11-09 01:39:01,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467815610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:01,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:01,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:39:01,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359925835] [2024-11-09 01:39:01,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:01,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:39:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:01,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:39:01,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:39:01,878 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:01,912 INFO L93 Difference]: Finished difference Result 201 states and 314 transitions. [2024-11-09 01:39:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:39:01,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-09 01:39:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:01,959 INFO L225 Difference]: With dead ends: 201 [2024-11-09 01:39:01,964 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 01:39:01,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:39:01,999 INFO L432 NwaCegarLoop]: 147 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, 147 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:39:02,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 01:39:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 01:39:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-11-09 01:39:02,060 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 100 [2024-11-09 01:39:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:02,061 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-11-09 01:39:02,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-11-09 01:39:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:39:02,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:02,066 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:39:02,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:02,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash -269428335, now seen corresponding path program 1 times [2024-11-09 01:39:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:02,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642082844] [2024-11-09 01:39:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642082844] [2024-11-09 01:39:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642082844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:02,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:39:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870587834] [2024-11-09 01:39:02,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:02,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:02,312 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:02,344 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2024-11-09 01:39:02,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:39:02,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-09 01:39:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:02,348 INFO L225 Difference]: With dead ends: 199 [2024-11-09 01:39:02,348 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 01:39:02,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:39:02,350 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 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:39:02,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 01:39:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 01:39:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-09 01:39:02,367 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 100 [2024-11-09 01:39:02,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:02,368 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-09 01:39:02,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-09 01:39:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:39:02,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:02,370 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:39:02,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1594284529, now seen corresponding path program 1 times [2024-11-09 01:39:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:02,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131660393] [2024-11-09 01:39:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:02,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:02,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131660393] [2024-11-09 01:39:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131660393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:02,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:02,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119594342] [2024-11-09 01:39:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:02,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:39:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:39:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:02,532 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:02,556 INFO L93 Difference]: Finished difference Result 202 states and 297 transitions. [2024-11-09 01:39:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:39:02,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-09 01:39:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:02,559 INFO L225 Difference]: With dead ends: 202 [2024-11-09 01:39:02,559 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 01:39:02,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:02,560 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:02,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 01:39:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 01:39:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 89 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-11-09 01:39:02,574 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 100 [2024-11-09 01:39:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:02,574 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-11-09 01:39:02,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-11-09 01:39:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:39:02,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:02,576 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:39:02,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1689565517, now seen corresponding path program 1 times [2024-11-09 01:39:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:02,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611312137] [2024-11-09 01:39:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:02,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:02,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611312137] [2024-11-09 01:39:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611312137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:02,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:02,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:39:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088848182] [2024-11-09 01:39:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:02,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:02,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:02,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:02,789 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:02,818 INFO L93 Difference]: Finished difference Result 205 states and 300 transitions. [2024-11-09 01:39:02,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:39:02,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-09 01:39:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:02,820 INFO L225 Difference]: With dead ends: 205 [2024-11-09 01:39:02,821 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 01:39:02,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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:39:02,823 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 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:39:02,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 01:39:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-09 01:39:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2024-11-09 01:39:02,829 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 100 [2024-11-09 01:39:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:02,829 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2024-11-09 01:39:02,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2024-11-09 01:39:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:39:02,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:02,831 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:39:02,831 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:02,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:02,831 INFO L85 PathProgramCache]: Analyzing trace with hash -10795469, now seen corresponding path program 1 times [2024-11-09 01:39:02,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:02,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085378879] [2024-11-09 01:39:02,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:02,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:02,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:02,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085378879] [2024-11-09 01:39:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085378879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:02,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:02,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772213377] [2024-11-09 01:39:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:02,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:39:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:02,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:39:02,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:02,986 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:03,016 INFO L93 Difference]: Finished difference Result 252 states and 368 transitions. [2024-11-09 01:39:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:39:03,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-09 01:39:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:03,018 INFO L225 Difference]: With dead ends: 252 [2024-11-09 01:39:03,018 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 01:39:03,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:03,019 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 60 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:03,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 01:39:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2024-11-09 01:39:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 109 states have (on average 1.4311926605504588) internal successors, (156), 109 states have internal predecessors, (156), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-11-09 01:39:03,032 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 103 [2024-11-09 01:39:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:03,033 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-11-09 01:39:03,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-11-09 01:39:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:39:03,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:03,038 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:03,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:39:03,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:03,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:03,039 INFO L85 PathProgramCache]: Analyzing trace with hash -408656968, now seen corresponding path program 1 times [2024-11-09 01:39:03,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:03,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219624105] [2024-11-09 01:39:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:03,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:03,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:03,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219624105] [2024-11-09 01:39:03,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219624105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:03,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:03,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:03,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054433122] [2024-11-09 01:39:03,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:03,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:39:03,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:03,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:39:03,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:03,176 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:03,192 INFO L93 Difference]: Finished difference Result 244 states and 359 transitions. [2024-11-09 01:39:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:39:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-09 01:39:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:03,193 INFO L225 Difference]: With dead ends: 244 [2024-11-09 01:39:03,194 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 01:39:03,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:03,196 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:03,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 01:39:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 01:39:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 110 states have internal predecessors, (157), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-11-09 01:39:03,210 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 103 [2024-11-09 01:39:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:03,211 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-11-09 01:39:03,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-11-09 01:39:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:39:03,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:03,216 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:03,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:39:03,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:03,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash 271401402, now seen corresponding path program 1 times [2024-11-09 01:39:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:03,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330587303] [2024-11-09 01:39:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330587303] [2024-11-09 01:39:05,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330587303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:05,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:05,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 01:39:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387200218] [2024-11-09 01:39:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:05,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:39:05,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:05,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:39:05,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:39:05,303 INFO L87 Difference]: Start difference. First operand 124 states and 181 transitions. Second operand has 16 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 16 states have internal predecessors, (46), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 01:39:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:06,324 INFO L93 Difference]: Finished difference Result 324 states and 470 transitions. [2024-11-09 01:39:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:39:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 16 states have internal predecessors, (46), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) Word has length 103 [2024-11-09 01:39:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:06,327 INFO L225 Difference]: With dead ends: 324 [2024-11-09 01:39:06,327 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 01:39:06,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:39:06,328 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 575 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:06,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1295 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:39:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 01:39:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2024-11-09 01:39:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 181 states have (on average 1.419889502762431) internal successors, (257), 182 states have internal predecessors, (257), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:39:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 289 transitions. [2024-11-09 01:39:06,344 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 289 transitions. Word has length 103 [2024-11-09 01:39:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:06,344 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 289 transitions. [2024-11-09 01:39:06,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 16 states have internal predecessors, (46), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 01:39:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 289 transitions. [2024-11-09 01:39:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:39:06,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:06,346 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:06,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:39:06,346 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:06,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash -291466267, now seen corresponding path program 1 times [2024-11-09 01:39:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:06,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516497361] [2024-11-09 01:39:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:39:06,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733610554] [2024-11-09 01:39:06,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:06,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:39:06,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:39:06,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:39:06,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:39:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:39:06,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:06,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:06,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:06,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516497361] [2024-11-09 01:39:06,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:39:06,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733610554] [2024-11-09 01:39:06,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733610554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:06,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:06,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:06,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646192122] [2024-11-09 01:39:06,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:06,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:06,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:06,935 INFO L87 Difference]: Start difference. First operand 200 states and 289 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:07,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:07,100 INFO L93 Difference]: Finished difference Result 542 states and 787 transitions. [2024-11-09 01:39:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:39:07,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-09 01:39:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:07,103 INFO L225 Difference]: With dead ends: 542 [2024-11-09 01:39:07,105 INFO L226 Difference]: Without dead ends: 345 [2024-11-09 01:39:07,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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:39:07,107 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 134 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:07,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 366 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-09 01:39:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 274. [2024-11-09 01:39:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 242 states have (on average 1.4049586776859504) internal successors, (340), 243 states have internal predecessors, (340), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:39:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 396 transitions. [2024-11-09 01:39:07,138 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 396 transitions. Word has length 105 [2024-11-09 01:39:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:07,140 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 396 transitions. [2024-11-09 01:39:07,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 396 transitions. [2024-11-09 01:39:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:39:07,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:07,142 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:07,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:39:07,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:39:07,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:07,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:07,344 INFO L85 PathProgramCache]: Analyzing trace with hash 170711681, now seen corresponding path program 1 times [2024-11-09 01:39:07,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:07,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7924776] [2024-11-09 01:39:07,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:07,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7924776] [2024-11-09 01:39:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7924776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:08,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:08,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:39:08,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541103687] [2024-11-09 01:39:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:08,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:39:08,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:39:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:39:08,806 INFO L87 Difference]: Start difference. First operand 274 states and 396 transitions. Second operand has 11 states, 8 states have (on average 6.125) internal successors, (49), 11 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 01:39:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:09,427 INFO L93 Difference]: Finished difference Result 607 states and 869 transitions. [2024-11-09 01:39:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:39:09,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.125) internal successors, (49), 11 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 106 [2024-11-09 01:39:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:09,430 INFO L225 Difference]: With dead ends: 607 [2024-11-09 01:39:09,430 INFO L226 Difference]: Without dead ends: 410 [2024-11-09 01:39:09,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:39:09,431 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 380 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:09,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 711 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:39:09,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-09 01:39:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 296. [2024-11-09 01:39:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 264 states have (on average 1.3977272727272727) internal successors, (369), 265 states have internal predecessors, (369), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:39:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 425 transitions. [2024-11-09 01:39:09,454 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 425 transitions. Word has length 106 [2024-11-09 01:39:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:09,455 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 425 transitions. [2024-11-09 01:39:09,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.125) internal successors, (49), 11 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 01:39:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 425 transitions. [2024-11-09 01:39:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:39:09,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:09,456 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:09,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:39:09,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:09,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash 871776259, now seen corresponding path program 1 times [2024-11-09 01:39:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:09,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717430023] [2024-11-09 01:39:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:10,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717430023] [2024-11-09 01:39:10,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717430023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:10,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:10,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:39:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130025371] [2024-11-09 01:39:10,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:10,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:39:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:39:10,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:10,346 INFO L87 Difference]: Start difference. First operand 296 states and 425 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:11,060 INFO L93 Difference]: Finished difference Result 718 states and 1032 transitions. [2024-11-09 01:39:11,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:39:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-09 01:39:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:11,063 INFO L225 Difference]: With dead ends: 718 [2024-11-09 01:39:11,063 INFO L226 Difference]: Without dead ends: 503 [2024-11-09 01:39:11,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:39:11,064 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 365 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:11,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1133 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:39:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-09 01:39:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 366. [2024-11-09 01:39:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 334 states have (on average 1.4221556886227544) internal successors, (475), 335 states have internal predecessors, (475), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:39:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 531 transitions. [2024-11-09 01:39:11,120 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 531 transitions. Word has length 106 [2024-11-09 01:39:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:11,120 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 531 transitions. [2024-11-09 01:39:11,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 531 transitions. [2024-11-09 01:39:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:39:11,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:11,122 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:11,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:39:11,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:11,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash 449074433, now seen corresponding path program 1 times [2024-11-09 01:39:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:11,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027627186] [2024-11-09 01:39:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027627186] [2024-11-09 01:39:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027627186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:12,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:39:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275659638] [2024-11-09 01:39:12,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:12,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:39:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:12,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:39:12,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:12,671 INFO L87 Difference]: Start difference. First operand 366 states and 531 transitions. Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 01:39:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:13,655 INFO L93 Difference]: Finished difference Result 812 states and 1175 transitions. [2024-11-09 01:39:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:39:13,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 106 [2024-11-09 01:39:13,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:13,659 INFO L225 Difference]: With dead ends: 812 [2024-11-09 01:39:13,660 INFO L226 Difference]: Without dead ends: 554 [2024-11-09 01:39:13,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:39:13,662 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 345 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:13,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 871 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:39:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-09 01:39:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2024-11-09 01:39:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 506 states have (on average 1.41699604743083) internal successors, (717), 509 states have internal predecessors, (717), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 01:39:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 793 transitions. [2024-11-09 01:39:13,701 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 793 transitions. Word has length 106 [2024-11-09 01:39:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:13,701 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 793 transitions. [2024-11-09 01:39:13,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 01:39:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 793 transitions. [2024-11-09 01:39:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:39:13,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:13,703 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:13,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:39:13,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:13,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1594207252, now seen corresponding path program 1 times [2024-11-09 01:39:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:13,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884614807] [2024-11-09 01:39:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:15,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:15,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884614807] [2024-11-09 01:39:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884614807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:15,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:15,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 01:39:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496536922] [2024-11-09 01:39:15,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:15,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:39:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:15,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:39:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:39:15,291 INFO L87 Difference]: Start difference. First operand 551 states and 793 transitions. Second operand has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 01:39:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:16,737 INFO L93 Difference]: Finished difference Result 1045 states and 1494 transitions. [2024-11-09 01:39:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:39:16,738 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2024-11-09 01:39:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:16,741 INFO L225 Difference]: With dead ends: 1045 [2024-11-09 01:39:16,741 INFO L226 Difference]: Without dead ends: 638 [2024-11-09 01:39:16,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:39:16,743 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 924 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:16,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1275 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:39:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-09 01:39:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 568. [2024-11-09 01:39:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 519 states have (on average 1.4084778420038535) internal successors, (731), 522 states have internal predecessors, (731), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:39:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 811 transitions. [2024-11-09 01:39:16,780 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 811 transitions. Word has length 107 [2024-11-09 01:39:16,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:16,780 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 811 transitions. [2024-11-09 01:39:16,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 01:39:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 811 transitions. [2024-11-09 01:39:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:39:16,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:16,781 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:16,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:39:16,782 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:16,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:16,782 INFO L85 PathProgramCache]: Analyzing trace with hash -893142674, now seen corresponding path program 1 times [2024-11-09 01:39:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:16,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051564537] [2024-11-09 01:39:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:16,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:18,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051564537] [2024-11-09 01:39:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051564537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:18,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 01:39:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526330107] [2024-11-09 01:39:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:18,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:39:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:39:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:39:18,337 INFO L87 Difference]: Start difference. First operand 568 states and 811 transitions. Second operand has 13 states, 10 states have (on average 5.0) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 01:39:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:19,534 INFO L93 Difference]: Finished difference Result 994 states and 1422 transitions. [2024-11-09 01:39:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:39:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.0) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2024-11-09 01:39:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:19,541 INFO L225 Difference]: With dead ends: 994 [2024-11-09 01:39:19,541 INFO L226 Difference]: Without dead ends: 574 [2024-11-09 01:39:19,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:39:19,542 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 418 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:19,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1284 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:39:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-09 01:39:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 571. [2024-11-09 01:39:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 519 states have (on average 1.4026974951830442) internal successors, (728), 522 states have internal predecessors, (728), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:39:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 812 transitions. [2024-11-09 01:39:19,588 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 812 transitions. Word has length 107 [2024-11-09 01:39:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:19,588 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 812 transitions. [2024-11-09 01:39:19,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.0) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 01:39:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 812 transitions. [2024-11-09 01:39:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:39:19,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:19,590 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:19,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:39:19,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:19,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1777581763, now seen corresponding path program 1 times [2024-11-09 01:39:19,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:19,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511718071] [2024-11-09 01:39:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:19,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:19,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511718071] [2024-11-09 01:39:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511718071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:19,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:19,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:39:19,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881128667] [2024-11-09 01:39:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:19,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:39:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:19,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:39:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:39:19,796 INFO L87 Difference]: Start difference. First operand 571 states and 812 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:20,074 INFO L93 Difference]: Finished difference Result 1073 states and 1528 transitions. [2024-11-09 01:39:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:39:20,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-09 01:39:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:20,078 INFO L225 Difference]: With dead ends: 1073 [2024-11-09 01:39:20,078 INFO L226 Difference]: Without dead ends: 650 [2024-11-09 01:39:20,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:39:20,083 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 79 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:20,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 687 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:39:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-09 01:39:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 576. [2024-11-09 01:39:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 524 states have (on average 1.4045801526717556) internal successors, (736), 527 states have internal predecessors, (736), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:39:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 820 transitions. [2024-11-09 01:39:20,126 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 820 transitions. Word has length 108 [2024-11-09 01:39:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:20,127 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 820 transitions. [2024-11-09 01:39:20,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 820 transitions. [2024-11-09 01:39:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:39:20,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:20,128 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:20,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:39:20,128 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:20,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1076517185, now seen corresponding path program 1 times [2024-11-09 01:39:20,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:20,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073710954] [2024-11-09 01:39:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:20,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:21,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073710954] [2024-11-09 01:39:21,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073710954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:21,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:21,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:39:21,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771538975] [2024-11-09 01:39:21,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:21,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:39:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:21,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:39:21,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:21,129 INFO L87 Difference]: Start difference. First operand 576 states and 820 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:21,773 INFO L93 Difference]: Finished difference Result 1081 states and 1539 transitions. [2024-11-09 01:39:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:39:21,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-09 01:39:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:21,776 INFO L225 Difference]: With dead ends: 1081 [2024-11-09 01:39:21,776 INFO L226 Difference]: Without dead ends: 653 [2024-11-09 01:39:21,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:39:21,780 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 288 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:21,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 822 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:39:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-09 01:39:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 580. [2024-11-09 01:39:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 527 states have (on average 1.398481973434535) internal successors, (737), 530 states have internal predecessors, (737), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:39:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 821 transitions. [2024-11-09 01:39:21,820 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 821 transitions. Word has length 108 [2024-11-09 01:39:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:21,821 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 821 transitions. [2024-11-09 01:39:21,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 821 transitions. [2024-11-09 01:39:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:39:21,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:21,822 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:39:21,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:21,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:21,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1718988669, now seen corresponding path program 1 times [2024-11-09 01:39:21,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:21,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911153214] [2024-11-09 01:39:21,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:22,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911153214] [2024-11-09 01:39:22,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911153214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:22,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:22,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 01:39:22,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856261394] [2024-11-09 01:39:22,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:22,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:39:22,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:23,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:39:23,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:39:23,001 INFO L87 Difference]: Start difference. First operand 580 states and 821 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:23,851 INFO L93 Difference]: Finished difference Result 1210 states and 1723 transitions. [2024-11-09 01:39:23,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:39:23,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-09 01:39:23,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:23,855 INFO L225 Difference]: With dead ends: 1210 [2024-11-09 01:39:23,855 INFO L226 Difference]: Without dead ends: 782 [2024-11-09 01:39:23,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:39:23,857 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 412 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:23,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1152 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:39:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-09 01:39:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 651. [2024-11-09 01:39:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 598 states have (on average 1.4063545150501673) internal successors, (841), 601 states have internal predecessors, (841), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:39:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 925 transitions. [2024-11-09 01:39:23,903 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 925 transitions. Word has length 108 [2024-11-09 01:39:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:23,903 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 925 transitions. [2024-11-09 01:39:23,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 925 transitions. [2024-11-09 01:39:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:39:23,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:23,904 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:23,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:39:23,905 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:23,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2141690495, now seen corresponding path program 1 times [2024-11-09 01:39:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313014912] [2024-11-09 01:39:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:24,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:24,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313014912] [2024-11-09 01:39:24,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313014912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:24,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:24,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:39:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953316768] [2024-11-09 01:39:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:24,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:39:24,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:24,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:39:24,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:24,901 INFO L87 Difference]: Start difference. First operand 651 states and 925 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:25,658 INFO L93 Difference]: Finished difference Result 1245 states and 1774 transitions. [2024-11-09 01:39:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:39:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-09 01:39:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:25,662 INFO L225 Difference]: With dead ends: 1245 [2024-11-09 01:39:25,662 INFO L226 Difference]: Without dead ends: 777 [2024-11-09 01:39:25,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:39:25,664 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 219 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:25,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1154 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:39:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-09 01:39:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 577. [2024-11-09 01:39:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 524 states have (on average 1.3931297709923665) internal successors, (730), 527 states have internal predecessors, (730), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:39:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 814 transitions. [2024-11-09 01:39:25,710 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 814 transitions. Word has length 108 [2024-11-09 01:39:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:25,710 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 814 transitions. [2024-11-09 01:39:25,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 814 transitions. [2024-11-09 01:39:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:39:25,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:25,711 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:39:25,712 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:25,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:25,712 INFO L85 PathProgramCache]: Analyzing trace with hash -899801948, now seen corresponding path program 1 times [2024-11-09 01:39:25,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:25,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183930764] [2024-11-09 01:39:25,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183930764] [2024-11-09 01:39:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183930764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:26,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:26,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 01:39:26,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955759292] [2024-11-09 01:39:26,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:26,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:39:26,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:26,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:39:26,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:39:26,903 INFO L87 Difference]: Start difference. First operand 577 states and 814 transitions. Second operand has 13 states, 10 states have (on average 5.2) internal successors, (52), 13 states have internal predecessors, (52), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 01:39:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:27,882 INFO L93 Difference]: Finished difference Result 1131 states and 1594 transitions. [2024-11-09 01:39:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:39:27,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.2) internal successors, (52), 13 states have internal predecessors, (52), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 109 [2024-11-09 01:39:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:27,889 INFO L225 Difference]: With dead ends: 1131 [2024-11-09 01:39:27,889 INFO L226 Difference]: Without dead ends: 706 [2024-11-09 01:39:27,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:39:27,891 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 328 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:27,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1255 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:39:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-09 01:39:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 582. [2024-11-09 01:39:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 529 states have (on average 1.391304347826087) internal successors, (736), 532 states have internal predecessors, (736), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:39:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 820 transitions. [2024-11-09 01:39:27,939 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 820 transitions. Word has length 109 [2024-11-09 01:39:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:27,939 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 820 transitions. [2024-11-09 01:39:27,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.2) internal successors, (52), 13 states have internal predecessors, (52), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 01:39:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 820 transitions. [2024-11-09 01:39:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:39:27,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:27,942 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:27,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:39:27,942 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:27,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:27,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1292228241, now seen corresponding path program 1 times [2024-11-09 01:39:27,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:27,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033925090] [2024-11-09 01:39:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:28,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033925090] [2024-11-09 01:39:28,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033925090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:28,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:28,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:39:28,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173851686] [2024-11-09 01:39:28,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:28,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:39:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:28,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:39:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:28,516 INFO L87 Difference]: Start difference. First operand 582 states and 820 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:29,142 INFO L93 Difference]: Finished difference Result 1263 states and 1784 transitions. [2024-11-09 01:39:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:39:29,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-09 01:39:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:29,145 INFO L225 Difference]: With dead ends: 1263 [2024-11-09 01:39:29,146 INFO L226 Difference]: Without dead ends: 835 [2024-11-09 01:39:29,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:39:29,147 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 215 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:29,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1121 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:39:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-11-09 01:39:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 697. [2024-11-09 01:39:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 639 states have (on average 1.3959311424100156) internal successors, (892), 643 states have internal predecessors, (892), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 01:39:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 984 transitions. [2024-11-09 01:39:29,210 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 984 transitions. Word has length 109 [2024-11-09 01:39:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:29,210 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 984 transitions. [2024-11-09 01:39:29,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 984 transitions. [2024-11-09 01:39:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:39:29,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:29,212 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:29,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:39:29,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:29,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1345789881, now seen corresponding path program 1 times [2024-11-09 01:39:29,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:29,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017696093] [2024-11-09 01:39:29,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:29,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:29,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:29,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017696093] [2024-11-09 01:39:29,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017696093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:29,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:29,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:39:29,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216027398] [2024-11-09 01:39:29,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:29,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:29,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:29,407 INFO L87 Difference]: Start difference. First operand 697 states and 984 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:29,579 INFO L93 Difference]: Finished difference Result 1247 states and 1769 transitions. [2024-11-09 01:39:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-09 01:39:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:29,582 INFO L225 Difference]: With dead ends: 1247 [2024-11-09 01:39:29,582 INFO L226 Difference]: Without dead ends: 697 [2024-11-09 01:39:29,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:29,584 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 4 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:29,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 477 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-09 01:39:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-09 01:39:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 639 states have (on average 1.3928012519561814) internal successors, (890), 643 states have internal predecessors, (890), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 01:39:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 982 transitions. [2024-11-09 01:39:29,632 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 982 transitions. Word has length 110 [2024-11-09 01:39:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 982 transitions. [2024-11-09 01:39:29,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 982 transitions. [2024-11-09 01:39:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:39:29,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:29,633 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:29,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 01:39:29,634 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:29,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:29,634 INFO L85 PathProgramCache]: Analyzing trace with hash -459648453, now seen corresponding path program 1 times [2024-11-09 01:39:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914437328] [2024-11-09 01:39:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:39:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:39:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:39:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:30,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:30,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914437328] [2024-11-09 01:39:30,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914437328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:30,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:30,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-09 01:39:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805795493] [2024-11-09 01:39:30,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:30,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 01:39:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:30,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 01:39:30,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:39:30,869 INFO L87 Difference]: Start difference. First operand 697 states and 982 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:32,199 INFO L93 Difference]: Finished difference Result 1487 states and 2095 transitions. [2024-11-09 01:39:32,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 01:39:32,200 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2024-11-09 01:39:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:32,203 INFO L225 Difference]: With dead ends: 1487 [2024-11-09 01:39:32,203 INFO L226 Difference]: Without dead ends: 970 [2024-11-09 01:39:32,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2024-11-09 01:39:32,205 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 224 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:32,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 2330 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:39:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-09 01:39:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 763. [2024-11-09 01:39:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 705 states have (on average 1.398581560283688) internal successors, (986), 709 states have internal predecessors, (986), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 01:39:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1078 transitions. [2024-11-09 01:39:32,305 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1078 transitions. Word has length 110 [2024-11-09 01:39:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:32,306 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1078 transitions. [2024-11-09 01:39:32,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1078 transitions. [2024-11-09 01:39:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:39:32,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:32,308 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:32,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 01:39:32,308 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:32,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1609879279, now seen corresponding path program 1 times [2024-11-09 01:39:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078654009] [2024-11-09 01:39:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:39:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626221513] [2024-11-09 01:39:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:32,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:39:32,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:39:32,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:39:32,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:39:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:39:32,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:39:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:39:32,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:39:32,852 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:39:32,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:39:32,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:39:33,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 01:39:33,059 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:33,173 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:39:33,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:39:33 BoogieIcfgContainer [2024-11-09 01:39:33,176 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:39:33,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:39:33,177 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:39:33,177 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:39:33,177 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:01" (3/4) ... [2024-11-09 01:39:33,180 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:39:33,181 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:39:33,181 INFO L158 Benchmark]: Toolchain (without parser) took 32949.35ms. Allocated memory was 174.1MB in the beginning and 906.0MB in the end (delta: 731.9MB). Free memory was 107.2MB in the beginning and 736.4MB in the end (delta: -629.2MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2024-11-09 01:39:33,181 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:39:33,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.08ms. Allocated memory is still 174.1MB. Free memory was 106.9MB in the beginning and 89.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:39:33,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.97ms. Allocated memory is still 174.1MB. Free memory was 89.7MB in the beginning and 85.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:39:33,184 INFO L158 Benchmark]: Boogie Preprocessor took 69.25ms. Allocated memory is still 174.1MB. Free memory was 85.3MB in the beginning and 80.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:39:33,184 INFO L158 Benchmark]: RCFGBuilder took 670.12ms. Allocated memory is still 174.1MB. Free memory was 80.4MB in the beginning and 113.6MB in the end (delta: -33.1MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-09 01:39:33,184 INFO L158 Benchmark]: TraceAbstraction took 31797.65ms. Allocated memory was 174.1MB in the beginning and 906.0MB in the end (delta: 731.9MB). Free memory was 113.6MB in the beginning and 736.4MB in the end (delta: -622.9MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2024-11-09 01:39:33,184 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 906.0MB. Free memory is still 736.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:39:33,185 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.19ms. Allocated memory is still 121.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.08ms. Allocated memory is still 174.1MB. Free memory was 106.9MB in the beginning and 89.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.97ms. Allocated memory is still 174.1MB. Free memory was 89.7MB in the beginning and 85.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.25ms. Allocated memory is still 174.1MB. Free memory was 85.3MB in the beginning and 80.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 670.12ms. Allocated memory is still 174.1MB. Free memory was 80.4MB in the beginning and 113.6MB in the end (delta: -33.1MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31797.65ms. Allocated memory was 174.1MB in the beginning and 906.0MB in the end (delta: 731.9MB). Free memory was 113.6MB in the beginning and 736.4MB in the end (delta: -622.9MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 906.0MB. Free memory is still 736.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L29] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L30] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L35] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0][0]); [L36] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1][0]); [L37] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[0][1]); [L38] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer = &(unsigned_short_int_Array_0[1][1]); [L39] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer = &(unsigned_short_int_Array_0[0][2]); [L40] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer = &(unsigned_short_int_Array_0[1][2]); [L41] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 8; [L42] unsigned short int last_1_unsigned_short_int_Array_0_1__2_ = 10; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=0, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR unsigned_short_int_Array_0[0][0] [L94] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L95] EXPR unsigned_short_int_Array_0[1][2] [L95] last_1_unsigned_short_int_Array_0_1__2_ = unsigned_short_int_Array_0[1][2] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L76] float_Array_0[0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L80] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L81] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L81] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L81] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L83] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L84] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L86] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L87] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L87] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L87] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L89] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L90] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L106] RET updateVariables() [L107] CALL step() [L46] COND TRUE last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L47] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L47] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) = (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))) [L49] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L49] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L49] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L49] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L60] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L60] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) [L62] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L62] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L62] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) [L69] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L69] (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1 [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L98] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L98] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) [L98] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) [L98] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L98] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L98] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98-L99] return (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.6s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4991 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4970 mSDsluCounter, 17787 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14589 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10477 IncrementalHoareTripleChecker+Invalid, 10888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 3198 mSDtfsCounter, 10477 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 697 SyntacticMatches, 1 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=763occurred in iteration=21, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 1375 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 2543 NumberOfCodeBlocks, 2543 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2195 ConstructedInterpolants, 0 QuantifiedInterpolants, 21223 SizeOfPredicates, 3 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 5544/5544 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:39:33,267 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-ap_file-2.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 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:39:35,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:39:35,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:39:35,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:39:35,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:39:35,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:39:35,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:39:35,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:39:35,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:39:35,253 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:39:35,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:39:35,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:39:35,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:39:35,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:39:35,255 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:39:35,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:39:35,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:39:35,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:39:35,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:39:35,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:39:35,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:39:35,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:39:35,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:39:35,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:39:35,258 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:39:35,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:39:35,258 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:39:35,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:39:35,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:39:35,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:39:35,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:39:35,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:39:35,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:39:35,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:39:35,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:39:35,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:39:35,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:39:35,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:39:35,260 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:39:35,261 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:39:35,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:39:35,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:39:35,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:39:35,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:39:35,261 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 -> 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 [2024-11-09 01:39:35,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:39:35,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:39:35,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:39:35,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:39:35,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:39:35,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-09 01:39:36,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:39:37,126 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:39:37,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-09 01:39:37,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340cbcfda/7f8d346ed08f4b69a89d97e897df80df/FLAG31eae94f6 [2024-11-09 01:39:37,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340cbcfda/7f8d346ed08f4b69a89d97e897df80df [2024-11-09 01:39:37,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:39:37,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:39:37,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:39:37,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:39:37,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:39:37,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8480a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37, skipping insertion in model container [2024-11-09 01:39:37,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:39:37,353 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-ap_file-2.i[916,929] [2024-11-09 01:39:37,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:39:37,442 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:39:37,452 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-ap_file-2.i[916,929] [2024-11-09 01:39:37,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:39:37,510 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:39:37,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37 WrapperNode [2024-11-09 01:39:37,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:39:37,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:39:37,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:39:37,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:39:37,517 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:39:37" (1/1) ... [2024-11-09 01:39:37,533 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:39:37" (1/1) ... [2024-11-09 01:39:37,578 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2024-11-09 01:39:37,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:39:37,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:39:37,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:39:37,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:39:37,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,626 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2024-11-09 01:39:37,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:39:37,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:39:37,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:39:37,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:39:37,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (1/1) ... [2024-11-09 01:39:37,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:39:37,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:39:37,717 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:39:37,722 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:39:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:39:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:39:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:39:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:39:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:39:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:39:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:39:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:39:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:39:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:39:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:39:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:39:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:39:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:39:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:39:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:39:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:39:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:39:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:39:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:39:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:39:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:39:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:39:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:39:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:39:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:39:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:39:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:39:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:39:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:39:37,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:39:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:39:37,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:39:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:39:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:39:37,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:39:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:39:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:39:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:39:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:39:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:39:37,926 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:39:37,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:39:38,473 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-09 01:39:38,474 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:39:38,486 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:39:38,487 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:39:38,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:38 BoogieIcfgContainer [2024-11-09 01:39:38,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:39:38,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:39:38,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:39:38,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:39:38,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:39:37" (1/3) ... [2024-11-09 01:39:38,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e9ed7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:39:38, skipping insertion in model container [2024-11-09 01:39:38,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:37" (2/3) ... [2024-11-09 01:39:38,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e9ed7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:39:38, skipping insertion in model container [2024-11-09 01:39:38,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:38" (3/3) ... [2024-11-09 01:39:38,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-09 01:39:38,508 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:39:38,508 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:39:38,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:39:38,568 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;@5374864a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:39:38,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:39:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:39:38,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:38,582 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:38,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:38,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:38,588 INFO L85 PathProgramCache]: Analyzing trace with hash 665478135, now seen corresponding path program 1 times [2024-11-09 01:39:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:38,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848545413] [2024-11-09 01:39:38,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:38,601 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:39:38,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:38,604 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:39:38,605 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:39:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:38,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:39:38,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-09 01:39:38,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:38,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:38,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848545413] [2024-11-09 01:39:38,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848545413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:38,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:39:38,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117917247] [2024-11-09 01:39:38,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:38,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:39:38,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:38,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:39:38,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:39:38,908 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:38,930 INFO L93 Difference]: Finished difference Result 193 states and 302 transitions. [2024-11-09 01:39:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:39:38,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-09 01:39:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:38,939 INFO L225 Difference]: With dead ends: 193 [2024-11-09 01:39:38,939 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 01:39:38,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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:39:38,946 INFO L432 NwaCegarLoop]: 141 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, 141 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:39:38,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 01:39:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 01:39:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-09 01:39:38,987 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 100 [2024-11-09 01:39:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:38,988 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-09 01:39:38,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-09 01:39:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:39:38,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:38,994 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:39,001 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:39:39,198 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:39:39,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:39,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:39,200 INFO L85 PathProgramCache]: Analyzing trace with hash -321302581, now seen corresponding path program 1 times [2024-11-09 01:39:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:39,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113906680] [2024-11-09 01:39:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:39,200 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:39:39,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:39,203 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:39:39,204 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:39:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:39,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:39:39,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 01:39:39,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:39,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:39,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113906680] [2024-11-09 01:39:39,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113906680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:39,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:39,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:39:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668170368] [2024-11-09 01:39:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:39,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:39,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:39,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:39,437 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:39,483 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2024-11-09 01:39:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:39:39,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-09 01:39:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:39,484 INFO L225 Difference]: With dead ends: 191 [2024-11-09 01:39:39,485 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:39:39,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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:39:39,486 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 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:39:39,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:39:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 01:39:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2024-11-09 01:39:39,498 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 100 [2024-11-09 01:39:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:39,499 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2024-11-09 01:39:39,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2024-11-09 01:39:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:39:39,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:39,504 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:39,512 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 (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:39:39,704 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:39:39,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:39,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1646158775, now seen corresponding path program 1 times [2024-11-09 01:39:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:39,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138278493] [2024-11-09 01:39:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:39,706 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:39:39,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:39,708 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:39:39,709 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:39:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:39,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:39:39,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:40,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:39:40,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2024-11-09 01:39:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:40,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:40,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:40,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138278493] [2024-11-09 01:39:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138278493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:40,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811651125] [2024-11-09 01:39:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:40,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:40,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:40,442 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:40,754 INFO L93 Difference]: Finished difference Result 289 states and 424 transitions. [2024-11-09 01:39:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:39:40,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-09 01:39:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:40,757 INFO L225 Difference]: With dead ends: 289 [2024-11-09 01:39:40,757 INFO L226 Difference]: Without dead ends: 194 [2024-11-09 01:39:40,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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:39:40,759 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 128 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:40,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 348 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:39:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-09 01:39:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 162. [2024-11-09 01:39:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.3925925925925926) internal successors, (188), 135 states have internal predecessors, (188), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:39:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 236 transitions. [2024-11-09 01:39:40,775 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 236 transitions. Word has length 100 [2024-11-09 01:39:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:40,775 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 236 transitions. [2024-11-09 01:39:40,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2024-11-09 01:39:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:39:40,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:40,779 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:40,787 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 (4)] Ended with exit code 0 [2024-11-09 01:39:40,979 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:39:40,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1349473664, now seen corresponding path program 1 times [2024-11-09 01:39:40,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:40,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022421185] [2024-11-09 01:39:40,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:40,981 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:39:40,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:40,983 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:39:40,983 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:39:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:39:41,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:41,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:41,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022421185] [2024-11-09 01:39:41,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022421185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:41,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416967691] [2024-11-09 01:39:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:41,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:39:41,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:41,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:39:41,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:41,198 INFO L87 Difference]: Start difference. First operand 162 states and 236 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:41,214 INFO L93 Difference]: Finished difference Result 266 states and 390 transitions. [2024-11-09 01:39:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:39:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-09 01:39:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:41,216 INFO L225 Difference]: With dead ends: 266 [2024-11-09 01:39:41,216 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 01:39:41,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:41,218 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:41,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 01:39:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-09 01:39:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 137 states have (on average 1.3868613138686132) internal successors, (190), 137 states have internal predecessors, (190), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:39:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 238 transitions. [2024-11-09 01:39:41,241 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 238 transitions. Word has length 106 [2024-11-09 01:39:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:41,241 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 238 transitions. [2024-11-09 01:39:41,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2024-11-09 01:39:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:39:41,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:41,243 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:41,250 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:39:41,443 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:39:41,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:41,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1357145730, now seen corresponding path program 1 times [2024-11-09 01:39:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:41,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430101082] [2024-11-09 01:39:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:41,444 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:39:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:41,447 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:39:41,448 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:39:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:39:41,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:41,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:39:41,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 01:39:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:41,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:41,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:41,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430101082] [2024-11-09 01:39:41,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430101082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:41,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:41,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:39:41,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733211893] [2024-11-09 01:39:41,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:41,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:41,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:41,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:41,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:41,798 INFO L87 Difference]: Start difference. First operand 164 states and 238 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:42,119 INFO L93 Difference]: Finished difference Result 321 states and 464 transitions. [2024-11-09 01:39:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-09 01:39:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:42,121 INFO L225 Difference]: With dead ends: 321 [2024-11-09 01:39:42,121 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 01:39:42,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:42,123 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 78 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:42,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 509 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:39:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 01:39:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2024-11-09 01:39:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 190 states have (on average 1.3894736842105264) internal successors, (264), 191 states have internal predecessors, (264), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:39:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 320 transitions. [2024-11-09 01:39:42,141 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 320 transitions. Word has length 106 [2024-11-09 01:39:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:42,141 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 320 transitions. [2024-11-09 01:39:42,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 320 transitions. [2024-11-09 01:39:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:39:42,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:42,142 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:42,150 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 (6)] Ended with exit code 0 [2024-11-09 01:39:42,343 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:39:42,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:42,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2058210308, now seen corresponding path program 1 times [2024-11-09 01:39:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574675456] [2024-11-09 01:39:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:42,345 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:39:42,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:42,346 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:39:42,347 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:39:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 01:39:42,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:44,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:39:44,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-09 01:39:44,694 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-11-09 01:39:44,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 42 [2024-11-09 01:39:44,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:39:44,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 22 [2024-11-09 01:39:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 01:39:44,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:46,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574675456] [2024-11-09 01:39:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574675456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [894012337] [2024-11-09 01:39:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:46,088 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:39:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:39:46,089 INFO L229 MonitoredProcess]: Starting monitored process 8 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:39:46,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-09 01:39:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 01:39:46,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:48,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:39:48,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-09 01:39:49,080 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2024-11-09 01:39:49,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 46 [2024-11-09 01:39:49,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-09 01:39:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 01:39:49,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:40:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [894012337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:40:11,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:40:11,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-09 01:40:11,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548940462] [2024-11-09 01:40:11,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:40:11,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:40:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:40:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:40:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=600, Unknown=5, NotChecked=0, Total=702 [2024-11-09 01:40:11,289 INFO L87 Difference]: Start difference. First operand 222 states and 320 transitions. Second operand has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 16 states have internal predecessors, (95), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-09 01:40:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:40:14,460 INFO L93 Difference]: Finished difference Result 545 states and 788 transitions. [2024-11-09 01:40:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:40:14,461 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 16 states have internal predecessors, (95), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 106 [2024-11-09 01:40:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:40:14,463 INFO L225 Difference]: With dead ends: 545 [2024-11-09 01:40:14,464 INFO L226 Difference]: Without dead ends: 393 [2024-11-09 01:40:14,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=256, Invalid=1071, Unknown=5, NotChecked=0, Total=1332 [2024-11-09 01:40:14,466 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 617 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:40:14,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1081 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 01:40:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-09 01:40:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2024-11-09 01:40:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 342 states have (on average 1.394736842105263) internal successors, (477), 345 states have internal predecessors, (477), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:40:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 561 transitions. [2024-11-09 01:40:14,503 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 561 transitions. Word has length 106 [2024-11-09 01:40:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:40:14,503 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 561 transitions. [2024-11-09 01:40:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 16 states have internal predecessors, (95), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-09 01:40:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 561 transitions. [2024-11-09 01:40:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:40:14,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:40:14,505 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:14,517 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:40:14,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-09 01:40:14,911 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 01:40:14,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:40:14,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:40:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash 467761120, now seen corresponding path program 1 times [2024-11-09 01:40:14,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:40:14,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984294707] [2024-11-09 01:40:14,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:40:14,913 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:40:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:40:14,915 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:40:14,915 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:40:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:15,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 01:40:15,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:40:16,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:40:17,174 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 12 treesize of output 8