./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.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 a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:38:15,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:38:15,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:38:15,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:38:15,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:38:15,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:38:15,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:38:15,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:38:15,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:38:15,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:38:15,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:38:15,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:38:15,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:38:15,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:38:15,597 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:38:15,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:38:15,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:38:15,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:38:15,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:38:15,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:38:15,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:38:15,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:38:15,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:38:15,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:38:15,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:38:15,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:38:15,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:38:15,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:38:15,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:38:15,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:38:15,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:38:15,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:38:15,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:38:15,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:38:15,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:38:15,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:38:15,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:38:15,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:38:15,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:38:15,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:38:15,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:38:15,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:38:15,607 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 -> a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 [2024-10-14 13:38:15,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:38:15,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:38:15,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:38:15,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:38:15,855 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:38:15,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2024-10-14 13:38:17,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:38:17,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:38:17,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2024-10-14 13:38:17,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1262d01e2/fe346b690f54469a86c59d31351cd54d/FLAGf6861381d [2024-10-14 13:38:17,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1262d01e2/fe346b690f54469a86c59d31351cd54d [2024-10-14 13:38:17,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:38:17,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:38:17,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:38:17,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:38:17,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:38:17,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32218190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17, skipping insertion in model container [2024-10-14 13:38:17,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:38:17,471 WARN L248 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-67.i[917,930] [2024-10-14 13:38:17,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:38:17,533 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:38:17,542 WARN L248 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-67.i[917,930] [2024-10-14 13:38:17,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:38:17,608 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:38:17,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17 WrapperNode [2024-10-14 13:38:17,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:38:17,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:38:17,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:38:17,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:38:17,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,680 INFO L138 Inliner]: procedures = 29, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2024-10-14 13:38:17,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:38:17,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:38:17,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:38:17,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:38:17,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,739 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2024-10-14 13:38:17,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:38:17,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:38:17,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:38:17,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:38:17,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (1/1) ... [2024-10-14 13:38:17,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:38:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:38:17,813 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-10-14 13:38:17,819 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-10-14 13:38:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:38:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:38:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:38:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-14 13:38:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:38:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:38:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:38:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:38:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:38:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:38:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 13:38:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:38:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:38:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:38:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:38:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:38:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:38:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-14 13:38:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:38:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:38:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:38:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-14 13:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:38:17,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 13:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:38:17,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:38:18,006 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:38:18,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:38:18,416 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-14 13:38:18,417 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:38:18,451 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:38:18,451 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:38:18,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:38:18 BoogieIcfgContainer [2024-10-14 13:38:18,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:38:18,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:38:18,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:38:18,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:38:18,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:38:17" (1/3) ... [2024-10-14 13:38:18,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9dd4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:38:18, skipping insertion in model container [2024-10-14 13:38:18,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:17" (2/3) ... [2024-10-14 13:38:18,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9dd4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:38:18, skipping insertion in model container [2024-10-14 13:38:18,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:38:18" (3/3) ... [2024-10-14 13:38:18,460 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-67.i [2024-10-14 13:38:18,474 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:38:18,474 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:38:18,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:38:18,528 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;@63bc4a76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:38:18,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:38:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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-10-14 13:38:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 13:38:18,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:18,544 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] [2024-10-14 13:38:18,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash -838961004, now seen corresponding path program 1 times [2024-10-14 13:38:18,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:18,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172123826] [2024-10-14 13:38:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:18,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172123826] [2024-10-14 13:38:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172123826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:18,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:18,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:38:18,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328019181] [2024-10-14 13:38:18,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:18,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:38:18,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:18,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:38:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:38:18,922 INFO L87 Difference]: Start difference. First operand has 86 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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.0) internal successors, (42), 2 states have internal predecessors, (42), 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-10-14 13:38:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:18,966 INFO L93 Difference]: Finished difference Result 169 states and 262 transitions. [2024-10-14 13:38:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:38:18,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 99 [2024-10-14 13:38:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:18,982 INFO L225 Difference]: With dead ends: 169 [2024-10-14 13:38:18,982 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 13:38:18,986 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-10-14 13:38:18,993 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:18,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:38:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 13:38:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 13:38:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 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-10-14 13:38:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2024-10-14 13:38:19,052 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 99 [2024-10-14 13:38:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:19,053 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2024-10-14 13:38:19,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-10-14 13:38:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-10-14 13:38:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 13:38:19,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:19,058 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] [2024-10-14 13:38:19,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:38:19,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:19,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2062729980, now seen corresponding path program 1 times [2024-10-14 13:38:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777076264] [2024-10-14 13:38:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777076264] [2024-10-14 13:38:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777076264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:19,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:38:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241897139] [2024-10-14 13:38:19,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:19,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:38:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:38:19,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:38:19,325 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 13:38:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:19,373 INFO L93 Difference]: Finished difference Result 169 states and 244 transitions. [2024-10-14 13:38:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:38:19,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 99 [2024-10-14 13:38:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:19,374 INFO L225 Difference]: With dead ends: 169 [2024-10-14 13:38:19,374 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 13:38:19,375 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-10-14 13:38:19,375 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:19,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:38:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 13:38:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 13:38:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 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-10-14 13:38:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 123 transitions. [2024-10-14 13:38:19,385 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 123 transitions. Word has length 99 [2024-10-14 13:38:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:19,386 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 123 transitions. [2024-10-14 13:38:19,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 13:38:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 123 transitions. [2024-10-14 13:38:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 13:38:19,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:19,388 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] [2024-10-14 13:38:19,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:38:19,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:19,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash 355754498, now seen corresponding path program 1 times [2024-10-14 13:38:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:19,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390028202] [2024-10-14 13:38:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:19,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:19,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390028202] [2024-10-14 13:38:19,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390028202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:19,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:19,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:38:19,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239383832] [2024-10-14 13:38:19,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:19,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:38:19,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:19,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:38:19,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:38:19,599 INFO L87 Difference]: Start difference. First operand 86 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 13:38:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:19,649 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2024-10-14 13:38:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:38:19,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 99 [2024-10-14 13:38:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:19,655 INFO L225 Difference]: With dead ends: 174 [2024-10-14 13:38:19,655 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 13:38:19,655 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-10-14 13:38:19,659 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:19,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:38:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 13:38:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-10-14 13:38:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 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-10-14 13:38:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-10-14 13:38:19,673 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 99 [2024-10-14 13:38:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:19,674 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-10-14 13:38:19,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 13:38:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-10-14 13:38:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 13:38:19,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:19,680 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] [2024-10-14 13:38:19,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:38:19,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:19,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash -453592128, now seen corresponding path program 1 times [2024-10-14 13:38:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:19,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980331053] [2024-10-14 13:38:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980331053] [2024-10-14 13:38:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980331053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:19,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:19,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:38:19,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170769322] [2024-10-14 13:38:19,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:19,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:38:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:19,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:38:19,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:38:19,859 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 13:38:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:19,897 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2024-10-14 13:38:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:38:19,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 99 [2024-10-14 13:38:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:19,899 INFO L225 Difference]: With dead ends: 178 [2024-10-14 13:38:19,899 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 13:38:19,900 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-10-14 13:38:19,901 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:19,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:38:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 13:38:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-14 13:38:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 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-10-14 13:38:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-14 13:38:19,911 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 99 [2024-10-14 13:38:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:19,911 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-14 13:38:19,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 13:38:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-14 13:38:19,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 13:38:19,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:19,912 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] [2024-10-14 13:38:19,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:38:19,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:19,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash -396333826, now seen corresponding path program 1 times [2024-10-14 13:38:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:19,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958456370] [2024-10-14 13:38:19,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:19,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:20,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:20,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958456370] [2024-10-14 13:38:20,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958456370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:20,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:20,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:38:20,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823422393] [2024-10-14 13:38:20,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:20,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:38:20,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:20,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:38:20,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:38:20,070 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 13:38:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:20,109 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2024-10-14 13:38:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:38:20,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 99 [2024-10-14 13:38:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:20,111 INFO L225 Difference]: With dead ends: 182 [2024-10-14 13:38:20,111 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 13:38:20,111 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-10-14 13:38:20,112 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:20,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 339 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:38:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 13:38:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-14 13:38:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 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-10-14 13:38:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-10-14 13:38:20,126 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 99 [2024-10-14 13:38:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:20,127 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-10-14 13:38:20,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 13:38:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-10-14 13:38:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 13:38:20,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:20,130 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] [2024-10-14 13:38:20,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:38:20,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:20,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -396274244, now seen corresponding path program 1 times [2024-10-14 13:38:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264536304] [2024-10-14 13:38:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-14 13:38:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264536304] [2024-10-14 13:38:24,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264536304] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:38:24,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426234708] [2024-10-14 13:38:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:24,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:38:24,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:38:24,479 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-10-14 13:38:24,480 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-10-14 13:38:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:24,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-14 13:38:24,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:38:25,372 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-10-14 13:38:25,809 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 32 treesize of output 16 [2024-10-14 13:38:26,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 77 [2024-10-14 13:38:26,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:38:26,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:38:26,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 87 [2024-10-14 13:38:26,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:38:26,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:38:26,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 74 treesize of output 50 [2024-10-14 13:38:27,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:38:27,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:38:27,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:38:27,286 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 248 treesize of output 120 [2024-10-14 13:38:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 48 proven. 146 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-14 13:38:27,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:38:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426234708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:38:28,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:38:28,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2024-10-14 13:38:28,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430712682] [2024-10-14 13:38:28,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:38:28,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 13:38:28,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:28,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 13:38:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1343, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 13:38:28,267 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 33 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 10 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 9 states have call predecessors, (24), 10 states have call successors, (24) [2024-10-14 13:38:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:34,374 INFO L93 Difference]: Finished difference Result 359 states and 491 transitions. [2024-10-14 13:38:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-14 13:38:34,375 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 10 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 9 states have call predecessors, (24), 10 states have call successors, (24) Word has length 99 [2024-10-14 13:38:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:34,376 INFO L225 Difference]: With dead ends: 359 [2024-10-14 13:38:34,376 INFO L226 Difference]: Without dead ends: 268 [2024-10-14 13:38:34,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1087, Invalid=4919, Unknown=0, NotChecked=0, Total=6006 [2024-10-14 13:38:34,378 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1030 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:34,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 2158 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 13:38:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-14 13:38:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 177. [2024-10-14 13:38:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 155 states have internal predecessors, (206), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:38:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2024-10-14 13:38:34,397 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 99 [2024-10-14 13:38:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:34,398 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2024-10-14 13:38:34,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 10 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 9 states have call predecessors, (24), 10 states have call successors, (24) [2024-10-14 13:38:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2024-10-14 13:38:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 13:38:34,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:34,399 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] [2024-10-14 13:38:34,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:38:34,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 13:38:34,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:34,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:34,601 INFO L85 PathProgramCache]: Analyzing trace with hash -177419526, now seen corresponding path program 1 times [2024-10-14 13:38:34,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:34,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725178284] [2024-10-14 13:38:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:34,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:34,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725178284] [2024-10-14 13:38:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725178284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:34,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:38:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363089633] [2024-10-14 13:38:34,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 13:38:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:34,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 13:38:34,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:38:34,679 INFO L87 Difference]: Start difference. First operand 177 states and 242 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-14 13:38:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:34,714 INFO L93 Difference]: Finished difference Result 391 states and 532 transitions. [2024-10-14 13:38:34,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 13:38:34,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 99 [2024-10-14 13:38:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:34,718 INFO L225 Difference]: With dead ends: 391 [2024-10-14 13:38:34,718 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 13:38:34,719 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-10-14 13:38:34,719 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 60 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:34,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 294 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:38:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 13:38:34,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2024-10-14 13:38:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 153 states have internal predecessors, (202), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:38:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 238 transitions. [2024-10-14 13:38:34,736 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 238 transitions. Word has length 99 [2024-10-14 13:38:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:34,736 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 238 transitions. [2024-10-14 13:38:34,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-14 13:38:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 238 transitions. [2024-10-14 13:38:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 13:38:34,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:34,737 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-10-14 13:38:34,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:38:34,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:34,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:34,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1419142029, now seen corresponding path program 1 times [2024-10-14 13:38:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:34,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796825950] [2024-10-14 13:38:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:35,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796825950] [2024-10-14 13:38:35,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796825950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:35,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:35,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 13:38:35,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409744910] [2024-10-14 13:38:35,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:35,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 13:38:35,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:35,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 13:38:35,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:38:35,649 INFO L87 Difference]: Start difference. First operand 175 states and 238 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 13:38:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:36,163 INFO L93 Difference]: Finished difference Result 512 states and 694 transitions. [2024-10-14 13:38:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:38:36,164 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-14 13:38:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:36,166 INFO L225 Difference]: With dead ends: 512 [2024-10-14 13:38:36,167 INFO L226 Difference]: Without dead ends: 338 [2024-10-14 13:38:36,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-14 13:38:36,168 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 552 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:36,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 715 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:38:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-14 13:38:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 204. [2024-10-14 13:38:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.3480662983425415) internal successors, (244), 182 states have internal predecessors, (244), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:38:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 280 transitions. [2024-10-14 13:38:36,191 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 280 transitions. Word has length 103 [2024-10-14 13:38:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:36,192 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 280 transitions. [2024-10-14 13:38:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 13:38:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 280 transitions. [2024-10-14 13:38:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 13:38:36,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:36,193 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-10-14 13:38:36,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:38:36,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:36,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1821856552, now seen corresponding path program 1 times [2024-10-14 13:38:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:36,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551971657] [2024-10-14 13:38:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:36,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551971657] [2024-10-14 13:38:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551971657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:38:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455008688] [2024-10-14 13:38:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:36,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:38:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:38:36,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:38:36,376 INFO L87 Difference]: Start difference. First operand 204 states and 280 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-10-14 13:38:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:36,618 INFO L93 Difference]: Finished difference Result 558 states and 768 transitions. [2024-10-14 13:38:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:38:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-10-14 13:38:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:36,621 INFO L225 Difference]: With dead ends: 558 [2024-10-14 13:38:36,621 INFO L226 Difference]: Without dead ends: 355 [2024-10-14 13:38:36,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:38:36,622 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 89 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:36,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 883 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:38:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-14 13:38:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 235. [2024-10-14 13:38:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 212 states have (on average 1.3726415094339623) internal successors, (291), 213 states have internal predecessors, (291), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:38:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 327 transitions. [2024-10-14 13:38:36,649 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 327 transitions. Word has length 105 [2024-10-14 13:38:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:36,649 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 327 transitions. [2024-10-14 13:38:36,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-10-14 13:38:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 327 transitions. [2024-10-14 13:38:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 13:38:36,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:36,650 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-10-14 13:38:36,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 13:38:36,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:36,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:36,651 INFO L85 PathProgramCache]: Analyzing trace with hash 141577384, now seen corresponding path program 1 times [2024-10-14 13:38:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:36,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936911804] [2024-10-14 13:38:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:36,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:36,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936911804] [2024-10-14 13:38:36,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936911804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:36,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:36,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:38:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024680522] [2024-10-14 13:38:36,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:36,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:38:36,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:36,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:38:36,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:38:36,832 INFO L87 Difference]: Start difference. First operand 235 states and 327 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-10-14 13:38:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:37,056 INFO L93 Difference]: Finished difference Result 547 states and 760 transitions. [2024-10-14 13:38:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:38:37,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-10-14 13:38:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:37,058 INFO L225 Difference]: With dead ends: 547 [2024-10-14 13:38:37,058 INFO L226 Difference]: Without dead ends: 313 [2024-10-14 13:38:37,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:38:37,059 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:37,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 820 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:38:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-14 13:38:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 261. [2024-10-14 13:38:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 239 states have internal predecessors, (329), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:38:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 365 transitions. [2024-10-14 13:38:37,085 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 365 transitions. Word has length 105 [2024-10-14 13:38:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:37,086 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 365 transitions. [2024-10-14 13:38:37,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-10-14 13:38:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 365 transitions. [2024-10-14 13:38:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 13:38:37,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:37,089 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-10-14 13:38:37,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:38:37,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:37,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:37,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1731794726, now seen corresponding path program 1 times [2024-10-14 13:38:37,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:37,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930498076] [2024-10-14 13:38:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:37,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:37,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:37,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930498076] [2024-10-14 13:38:37,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930498076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:37,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:37,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:38:37,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65689622] [2024-10-14 13:38:37,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:37,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:38:37,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:37,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:38:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:38:37,220 INFO L87 Difference]: Start difference. First operand 261 states and 365 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-10-14 13:38:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:37,355 INFO L93 Difference]: Finished difference Result 587 states and 813 transitions. [2024-10-14 13:38:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:38:37,356 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-10-14 13:38:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:37,357 INFO L225 Difference]: With dead ends: 587 [2024-10-14 13:38:37,358 INFO L226 Difference]: Without dead ends: 327 [2024-10-14 13:38:37,359 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-10-14 13:38:37,359 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 84 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:37,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 534 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:38:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-14 13:38:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 206. [2024-10-14 13:38:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 189 states have (on average 1.3862433862433863) internal successors, (262), 189 states have internal predecessors, (262), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 13:38:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 286 transitions. [2024-10-14 13:38:37,379 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 286 transitions. Word has length 106 [2024-10-14 13:38:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:37,379 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 286 transitions. [2024-10-14 13:38:37,379 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-10-14 13:38:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 286 transitions. [2024-10-14 13:38:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 13:38:37,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:37,380 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-10-14 13:38:37,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:38:37,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:37,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1243535749, now seen corresponding path program 1 times [2024-10-14 13:38:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:37,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142175967] [2024-10-14 13:38:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:38:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:38:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:38:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:38:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:38:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:38:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:38:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:38:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:38:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:38:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:38:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:38:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:38:37,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142175967] [2024-10-14 13:38:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142175967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:37,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:37,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:38:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196075238] [2024-10-14 13:38:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:37,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:38:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:38:37,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:38:37,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:38:37,492 INFO L87 Difference]: Start difference. First operand 206 states and 286 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-10-14 13:38:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:37,626 INFO L93 Difference]: Finished difference Result 469 states and 647 transitions. [2024-10-14 13:38:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:38:37,627 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-10-14 13:38:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:37,628 INFO L225 Difference]: With dead ends: 469 [2024-10-14 13:38:37,628 INFO L226 Difference]: Without dead ends: 264 [2024-10-14 13:38:37,629 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-10-14 13:38:37,629 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 83 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:37,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 506 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:38:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-14 13:38:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 205. [2024-10-14 13:38:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 188 states have (on average 1.377659574468085) internal successors, (259), 188 states have internal predecessors, (259), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 13:38:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 283 transitions. [2024-10-14 13:38:37,650 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 283 transitions. Word has length 106 [2024-10-14 13:38:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:37,650 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 283 transitions. [2024-10-14 13:38:37,651 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-10-14 13:38:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 283 transitions. [2024-10-14 13:38:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 13:38:37,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:37,652 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-10-14 13:38:37,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:38:37,652 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:37,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash 262424329, now seen corresponding path program 1 times [2024-10-14 13:38:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:38:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390159895] [2024-10-14 13:38:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:38:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:38:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59814928] [2024-10-14 13:38:37,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:38:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:38:37,723 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-10-14 13:38:37,724 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-10-14 13:38:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:38:38,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:38:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:38:38,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:38:38,449 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:38:38,450 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:38:38,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:38:38,655 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,SelfDestructingSolverStorable12 [2024-10-14 13:38:38,658 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:38:38,809 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:38:38,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:38:38 BoogieIcfgContainer [2024-10-14 13:38:38,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:38:38,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:38:38,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:38:38,814 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:38:38,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:38:18" (3/4) ... [2024-10-14 13:38:38,817 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:38:38,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:38:38,818 INFO L158 Benchmark]: Toolchain (without parser) took 21515.32ms. Allocated memory was 125.8MB in the beginning and 482.3MB in the end (delta: 356.5MB). Free memory was 72.1MB in the beginning and 173.7MB in the end (delta: -101.6MB). Peak memory consumption was 258.0MB. Max. memory is 16.1GB. [2024-10-14 13:38:38,819 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory was 99.4MB in the beginning and 99.3MB in the end (delta: 154.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 13:38:38,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.63ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 71.7MB in the beginning and 151.8MB in the end (delta: -80.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-10-14 13:38:38,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.10ms. Allocated memory is still 182.5MB. Free memory was 151.8MB in the beginning and 148.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 13:38:38,820 INFO L158 Benchmark]: Boogie Preprocessor took 98.14ms. Allocated memory is still 182.5MB. Free memory was 148.7MB in the beginning and 143.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 13:38:38,820 INFO L158 Benchmark]: RCFGBuilder took 671.57ms. Allocated memory is still 182.5MB. Free memory was 143.4MB in the beginning and 104.6MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-14 13:38:38,820 INFO L158 Benchmark]: TraceAbstraction took 20359.99ms. Allocated memory was 182.5MB in the beginning and 482.3MB in the end (delta: 299.9MB). Free memory was 104.6MB in the beginning and 174.8MB in the end (delta: -70.1MB). Peak memory consumption was 229.8MB. Max. memory is 16.1GB. [2024-10-14 13:38:38,820 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 482.3MB. Free memory was 174.8MB in the beginning and 173.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 13:38:38,823 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.16ms. Allocated memory is still 125.8MB. Free memory was 99.4MB in the beginning and 99.3MB in the end (delta: 154.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.63ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 71.7MB in the beginning and 151.8MB in the end (delta: -80.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.10ms. Allocated memory is still 182.5MB. Free memory was 151.8MB in the beginning and 148.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.14ms. Allocated memory is still 182.5MB. Free memory was 148.7MB in the beginning and 143.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 671.57ms. Allocated memory is still 182.5MB. Free memory was 143.4MB in the beginning and 104.6MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20359.99ms. Allocated memory was 182.5MB in the beginning and 482.3MB in the end (delta: 299.9MB). Free memory was 104.6MB in the beginning and 174.8MB in the end (delta: -70.1MB). Peak memory consumption was 229.8MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 482.3MB. Free memory was 174.8MB in the beginning and 173.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of shiftRight at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] double double_Array_0[1] = { 25.875 }; [L26-L28] double double_Array_0[1] = { 25.875 }; [L29] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L30-L32] float float_Array_0[2] = { 0.9, 15.125 }; [L30-L32] float float_Array_0[2] = { 0.9, 15.125 }; [L30-L32] float float_Array_0[2] = { 0.9, 15.125 }; [L33] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L34] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L35-L37] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L35-L37] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L35-L37] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L38] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L39] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1]); [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L43] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L44] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L45] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer = &(signed_short_int_Array_0[2]); [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L49] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L50] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L51] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[2]); [L52] signed long int last_1_signed_long_int_Array_0_1_ = 50; [L53] signed short int last_1_signed_short_int_Array_0_2_ = 2; [L54] unsigned short int last_1_unsigned_short_int_Array_0_2_ = 128; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L107] EXPR signed_long_int_Array_0[1] [L107] last_1_signed_long_int_Array_0_1_ = signed_long_int_Array_0[1] [L108] EXPR signed_short_int_Array_0[2] [L108] last_1_signed_short_int_Array_0_2_ = signed_short_int_Array_0[2] [L109] EXPR unsigned_short_int_Array_0[2] [L109] last_1_unsigned_short_int_Array_0_2_ = unsigned_short_int_Array_0[2] [L119] RET updateLastVariables() [L120] CALL updateVariables() [L87] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L88] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L88] 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L88] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L89] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L89] 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L89] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L90] float_Array_0[0] = __VERIFIER_nondet_float() [L91] EXPR float_Array_0[0] [L91] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L91] EXPR float_Array_0[0] [L91] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L92] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L93] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L94] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L95] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L95] CALL assume_abort_if_not(signed_long_int_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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L95] RET assume_abort_if_not(signed_long_int_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L96] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L97] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L98] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L98] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L98] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L99] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L100] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L100] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L101] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L101] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L101] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L102] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L103] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L103] CALL assume_abort_if_not(unsigned_short_int_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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L103] RET assume_abort_if_not(unsigned_short_int_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L104] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L104] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L104] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L120] RET updateVariables() [L121] CALL step() [L58] COND TRUE ! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L59] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) = ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L61] signed long int stepLocal_0 = 1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)); [L62] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L62] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L62] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, stepLocal_0=-63, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L62] COND TRUE ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > stepLocal_0 [L63] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L63] EXPR (((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0) [L63] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L63] EXPR (((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L63] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) = (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))) [L67] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L67] (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L68] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L68] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L69] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) [L70] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L70] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L70] signed long int stepLocal_2 = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)); [L71] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L71] unsigned short int stepLocal_1 = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)); [L72] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L72] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L75] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L75] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > stepLocal_2) [L82] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L82] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L82] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1 [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L112] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) [L112] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L112] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112-L113] return ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ; [L122] RET, EXPR property() [L122] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1982 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1982 mSDsluCounter, 7375 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5755 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2600 IncrementalHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 1620 mSDtfsCounter, 2600 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=10, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 620 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1531 NumberOfCodeBlocks, 1531 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1304 ConstructedInterpolants, 1 QuantifiedInterpolants, 11460 SizeOfPredicates, 11 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 3271/3432 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-10-14 13:38:38,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.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 a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:38:40,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:38:40,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:38:40,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:38:40,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:38:40,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:38:40,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:38:40,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:38:40,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:38:40,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:38:40,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:38:40,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:38:40,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:38:40,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:38:40,959 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:38:40,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:38:40,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:38:40,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:38:40,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:38:40,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:38:40,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:38:40,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:38:40,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:38:40,964 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:38:40,964 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:38:40,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:38:40,965 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:38:40,965 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:38:40,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:38:40,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:38:40,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:38:40,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:38:40,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:38:40,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:38:40,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:38:40,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:38:40,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:38:40,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:38:40,967 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:38:40,967 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:38:40,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:38:40,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:38:40,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:38:40,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:38:40,969 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:38:40,969 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 -> a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 [2024-10-14 13:38:41,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:38:41,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:38:41,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:38:41,268 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:38:41,268 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:38:41,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2024-10-14 13:38:42,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:38:42,771 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:38:42,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2024-10-14 13:38:42,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2666356/8b2aa36a5e524fb084dcf80a42091aac/FLAG3615159a1 [2024-10-14 13:38:43,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2666356/8b2aa36a5e524fb084dcf80a42091aac [2024-10-14 13:38:43,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:38:43,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:38:43,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:38:43,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:38:43,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:38:43,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4c5d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43, skipping insertion in model container [2024-10-14 13:38:43,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:38:43,333 WARN L248 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-67.i[917,930] [2024-10-14 13:38:43,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:38:43,424 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:38:43,434 WARN L248 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-67.i[917,930] [2024-10-14 13:38:43,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:38:43,484 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:38:43,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43 WrapperNode [2024-10-14 13:38:43,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:38:43,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:38:43,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:38:43,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:38:43,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,541 INFO L138 Inliner]: procedures = 39, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2024-10-14 13:38:43,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:38:43,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:38:43,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:38:43,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:38:43,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,590 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2024-10-14 13:38:43,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:38:43,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:38:43,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:38:43,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:38:43,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (1/1) ... [2024-10-14 13:38:43,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:38:43,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:38:43,701 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-10-14 13:38:43,703 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-10-14 13:38:43,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:38:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 13:38:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 13:38:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-14 13:38:43,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-14 13:38:43,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-14 13:38:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-14 13:38:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-14 13:38:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 13:38:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 13:38:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-14 13:38:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-14 13:38:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-14 13:38:43,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-14 13:38:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-14 13:38:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:38:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:38:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 13:38:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 13:38:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-14 13:38:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-14 13:38:43,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-14 13:38:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 13:38:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 13:38:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-14 13:38:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-14 13:38:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-14 13:38:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-14 13:38:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-14 13:38:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:38:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:38:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 13:38:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 13:38:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-14 13:38:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-14 13:38:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-14 13:38:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:38:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:38:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 13:38:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-14 13:38:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-14 13:38:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-14 13:38:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-14 13:38:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 13:38:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 13:38:43,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-14 13:38:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-14 13:38:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-14 13:38:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-14 13:38:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 13:38:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 13:38:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 13:38:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 13:38:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-14 13:38:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-14 13:38:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-14 13:38:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 13:38:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 13:38:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-14 13:38:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-14 13:38:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-14 13:38:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-14 13:38:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-14 13:38:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:38:43,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:38:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:38:43,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:38:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:38:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:38:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 13:38:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-14 13:38:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-14 13:38:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-14 13:38:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-14 13:38:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 13:38:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 13:38:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-14 13:38:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-14 13:38:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-14 13:38:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-14 13:38:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-14 13:38:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:38:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:38:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 13:38:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 13:38:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-14 13:38:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-14 13:38:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-14 13:38:43,945 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:38:43,947 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:38:44,686 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-14 13:38:44,686 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:38:44,735 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:38:44,735 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:38:44,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:38:44 BoogieIcfgContainer [2024-10-14 13:38:44,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:38:44,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:38:44,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:38:44,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:38:44,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:38:43" (1/3) ... [2024-10-14 13:38:44,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518390bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:38:44, skipping insertion in model container [2024-10-14 13:38:44,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:43" (2/3) ... [2024-10-14 13:38:44,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518390bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:38:44, skipping insertion in model container [2024-10-14 13:38:44,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:38:44" (3/3) ... [2024-10-14 13:38:44,747 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-67.i [2024-10-14 13:38:44,765 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:38:44,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:38:44,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:38:44,838 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;@4890be23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:38:44,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:38:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 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-10-14 13:38:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 13:38:44,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:44,856 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] [2024-10-14 13:38:44,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:44,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:44,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1937341915, now seen corresponding path program 1 times [2024-10-14 13:38:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:38:44,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284847839] [2024-10-14 13:38:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:44,878 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-10-14 13:38:44,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:38:44,882 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-10-14 13:38:44,884 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-10-14 13:38:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:45,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:38:45,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:38:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-14 13:38:45,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:38:45,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:38:45,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284847839] [2024-10-14 13:38:45,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284847839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:45,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:45,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:38:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197738487] [2024-10-14 13:38:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:45,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:38:45,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:38:45,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:38:45,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:38:45,303 INFO L87 Difference]: Start difference. First operand has 81 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-10-14 13:38:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:45,353 INFO L93 Difference]: Finished difference Result 159 states and 248 transitions. [2024-10-14 13:38:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:38:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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 98 [2024-10-14 13:38:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:45,362 INFO L225 Difference]: With dead ends: 159 [2024-10-14 13:38:45,362 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 13:38:45,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-10-14 13:38:45,369 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:45,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:38:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 13:38:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 13:38:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 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-10-14 13:38:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2024-10-14 13:38:45,408 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 98 [2024-10-14 13:38:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:45,408 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2024-10-14 13:38:45,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-10-14 13:38:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2024-10-14 13:38:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 13:38:45,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:45,413 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] [2024-10-14 13:38:45,423 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-10-14 13:38:45,613 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-10-14 13:38:45,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:45,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash 373844843, now seen corresponding path program 1 times [2024-10-14 13:38:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:38:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758163012] [2024-10-14 13:38:45,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:45,616 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-10-14 13:38:45,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:38:45,630 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-10-14 13:38:45,631 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-10-14 13:38:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:45,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:38:45,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:38:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-14 13:38:45,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:38:45,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:38:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758163012] [2024-10-14 13:38:45,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758163012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:45,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:45,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:38:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517916060] [2024-10-14 13:38:45,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:45,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:38:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:38:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:38:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:38:45,966 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10-14 13:38:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:46,034 INFO L93 Difference]: Finished difference Result 159 states and 230 transitions. [2024-10-14 13:38:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:38:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 98 [2024-10-14 13:38:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:46,036 INFO L225 Difference]: With dead ends: 159 [2024-10-14 13:38:46,036 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 13:38:46,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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-10-14 13:38:46,038 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:46,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:38:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 13:38:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 13:38:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 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-10-14 13:38:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2024-10-14 13:38:46,047 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 98 [2024-10-14 13:38:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:46,048 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2024-10-14 13:38:46,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10-14 13:38:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2024-10-14 13:38:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 13:38:46,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:46,050 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] [2024-10-14 13:38:46,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 13:38:46,250 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-10-14 13:38:46,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:46,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:46,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2041991507, now seen corresponding path program 1 times [2024-10-14 13:38:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:38:46,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460035707] [2024-10-14 13:38:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:46,252 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-10-14 13:38:46,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:38:46,253 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-10-14 13:38:46,254 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-10-14 13:38:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:46,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:38:46,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:38:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:46,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:38:46,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:38:46,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460035707] [2024-10-14 13:38:46,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460035707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:46,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:46,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:38:46,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641055684] [2024-10-14 13:38:46,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:46,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:38:46,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:38:46,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:38:46,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:38:46,590 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-10-14 13:38:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:46,683 INFO L93 Difference]: Finished difference Result 166 states and 238 transitions. [2024-10-14 13:38:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:38:46,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 98 [2024-10-14 13:38:46,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:46,685 INFO L225 Difference]: With dead ends: 166 [2024-10-14 13:38:46,685 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 13:38:46,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:38:46,686 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:46,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 410 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:38:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 13:38:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-14 13:38:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 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-10-14 13:38:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2024-10-14 13:38:46,699 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 98 [2024-10-14 13:38:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:46,700 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2024-10-14 13:38:46,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-10-14 13:38:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2024-10-14 13:38:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 13:38:46,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:46,702 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] [2024-10-14 13:38:46,712 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-10-14 13:38:46,902 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-10-14 13:38:46,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:46,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1443629163, now seen corresponding path program 1 times [2024-10-14 13:38:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:38:46,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697693298] [2024-10-14 13:38:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:46,904 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-10-14 13:38:46,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:38:46,907 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-10-14 13:38:46,908 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-10-14 13:38:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:47,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 13:38:47,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:38:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:47,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:38:47,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:38:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697693298] [2024-10-14 13:38:47,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697693298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:47,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:47,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:38:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481121880] [2024-10-14 13:38:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:47,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:38:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:38:47,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:38:47,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:38:47,244 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-10-14 13:38:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:47,388 INFO L93 Difference]: Finished difference Result 172 states and 243 transitions. [2024-10-14 13:38:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:38:47,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 98 [2024-10-14 13:38:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:47,391 INFO L225 Difference]: With dead ends: 172 [2024-10-14 13:38:47,391 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 13:38:47,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:38:47,392 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:47,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:38:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 13:38:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-10-14 13:38:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 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-10-14 13:38:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2024-10-14 13:38:47,402 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 98 [2024-10-14 13:38:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:47,402 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2024-10-14 13:38:47,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-10-14 13:38:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2024-10-14 13:38:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 13:38:47,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:47,404 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] [2024-10-14 13:38:47,414 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-10-14 13:38:47,608 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-10-14 13:38:47,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:47,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:47,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1500887465, now seen corresponding path program 1 times [2024-10-14 13:38:47,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:38:47,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406560472] [2024-10-14 13:38:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:47,609 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-10-14 13:38:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:38:47,612 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-10-14 13:38:47,613 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-10-14 13:38:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:47,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 13:38:47,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:38:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 13:38:47,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:38:47,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:38:47,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406560472] [2024-10-14 13:38:47,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406560472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:38:47,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:38:47,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:38:47,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568703314] [2024-10-14 13:38:47,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:38:47,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:38:47,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:38:47,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:38:47,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:38:47,894 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-14 13:38:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:38:48,036 INFO L93 Difference]: Finished difference Result 176 states and 247 transitions. [2024-10-14 13:38:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:38:48,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 98 [2024-10-14 13:38:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:38:48,039 INFO L225 Difference]: With dead ends: 176 [2024-10-14 13:38:48,039 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 13:38:48,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:38:48,042 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:38:48,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 598 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:38:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 13:38:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-10-14 13:38:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 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-10-14 13:38:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2024-10-14 13:38:48,053 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 124 transitions. Word has length 98 [2024-10-14 13:38:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:38:48,054 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 124 transitions. [2024-10-14 13:38:48,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-14 13:38:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 124 transitions. [2024-10-14 13:38:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 13:38:48,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:38:48,055 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] [2024-10-14 13:38:48,064 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-10-14 13:38:48,256 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-10-14 13:38:48,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:38:48,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:38:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1500947047, now seen corresponding path program 1 times [2024-10-14 13:38:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:38:48,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634119964] [2024-10-14 13:38:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:48,258 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-10-14 13:38:48,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:38:48,260 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-10-14 13:38:48,261 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-10-14 13:38:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:48,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 13:38:48,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:38:49,761 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 [2024-10-14 13:38:50,169 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 24 treesize of output 12 [2024-10-14 13:38:50,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-10-14 13:38:50,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:38:50,889 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 89 treesize of output 53 [2024-10-14 13:38:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 48 proven. 128 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-14 13:38:50,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:38:51,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:38:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634119964] [2024-10-14 13:38:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634119964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:38:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1005341710] [2024-10-14 13:38:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:38:51,677 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:38:51,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:38:51,680 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:38:51,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-14 13:38:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:38:51,997 WARN L253 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 145 conjuncts are in the unsatisfiable core [2024-10-14 13:38:52,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:38:52,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-14 13:38:55,943 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-10-14 13:38:57,691 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-10-14 13:39:01,049 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 [2024-10-14 13:39:04,290 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 30 treesize of output 25 [2024-10-14 13:39:08,738 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 [2024-10-14 13:39:11,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2024-10-14 13:39:12,908 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 26 treesize of output 21 [2024-10-14 13:39:13,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 13:39:13,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-10-14 13:39:14,625 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 139 treesize of output 79 [2024-10-14 13:39:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 230 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 13:39:14,656 INFO L311 TraceCheckSpWp]: Computing backward predicates...