./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-p_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-p_file-92.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 e0591871f2ff833ee138d20870c79176760037c48f330bc5791f7462916d2248 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:23:52,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:23:52,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:23:52,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:23:52,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:23:52,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:23:52,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:23:52,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:23:52,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:23:52,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:23:52,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:23:52,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:23:52,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:23:52,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:23:52,737 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:23:52,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:23:52,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:23:52,738 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:23:52,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:23:52,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:23:52,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:23:52,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:23:52,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:23:52,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:23:52,741 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:23:52,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:23:52,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:23:52,742 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:23:52,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:23:52,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:23:52,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:23:52,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:23:52,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:23:52,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:23:52,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:23:52,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:23:52,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:23:52,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:23:52,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:23:52,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:23:52,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:23:52,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:23:52,753 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 -> e0591871f2ff833ee138d20870c79176760037c48f330bc5791f7462916d2248 [2024-10-13 06:23:53,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:23:53,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:23:53,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:23:53,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:23:53,054 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:23:53,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-92.i [2024-10-13 06:23:54,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:23:54,769 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:23:54,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-92.i [2024-10-13 06:23:54,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f2c0850/c0b0b7cc05434a36ab3b3a1beee90c37/FLAGfc7a5eed6 [2024-10-13 06:23:54,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f2c0850/c0b0b7cc05434a36ab3b3a1beee90c37 [2024-10-13 06:23:54,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:23:54,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:23:54,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:23:54,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:23:54,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:23:54,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:23:54" (1/1) ... [2024-10-13 06:23:54,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b8258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:54, skipping insertion in model container [2024-10-13 06:23:54,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:23:54" (1/1) ... [2024-10-13 06:23:54,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:23:55,050 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-p_file-92.i[916,929] [2024-10-13 06:23:55,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:23:55,149 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:23:55,161 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-p_file-92.i[916,929] [2024-10-13 06:23:55,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:23:55,242 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:23:55,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55 WrapperNode [2024-10-13 06:23:55,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:23:55,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:23:55,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:23:55,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:23:55,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,320 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2024-10-13 06:23:55,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:23:55,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:23:55,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:23:55,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:23:55,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,383 INFO L175 MemorySlicer]: Split 123 memory accesses to 17 slices as follows [2, 3, 12, 8, 10, 12, 16, 5, 10, 8, 3, 3, 7, 7, 8, 6, 3]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1]. [2024-10-13 06:23:55,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:23:55,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:23:55,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:23:55,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:23:55,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (1/1) ... [2024-10-13 06:23:55,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:23:55,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:23:55,483 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-13 06:23:55,490 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-13 06:23:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:23:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:23:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:23:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 06:23:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 06:23:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 06:23:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 06:23:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-13 06:23:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-13 06:23:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-13 06:23:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-13 06:23:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-13 06:23:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-13 06:23:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-13 06:23:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-13 06:23:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-13 06:23:55,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-13 06:23:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2024-10-13 06:23:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:23:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:23:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:23:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:23:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:23:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:23:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 06:23:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 06:23:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 06:23:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 06:23:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 06:23:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-13 06:23:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-13 06:23:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-13 06:23:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-13 06:23:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-13 06:23:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-13 06:23:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:23:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:23:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 06:23:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 06:23:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 06:23:55,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 06:23:55,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-13 06:23:55,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-13 06:23:55,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-13 06:23:55,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-13 06:23:55,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-13 06:23:55,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-13 06:23:55,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-13 06:23:55,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-13 06:23:55,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-13 06:23:55,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-13 06:23:55,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2024-10-13 06:23:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:23:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:23:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:23:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:23:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:23:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:23:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 06:23:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 06:23:55,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 06:23:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 06:23:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 06:23:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-13 06:23:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-13 06:23:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-13 06:23:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-13 06:23:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-13 06:23:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-13 06:23:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:23:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:23:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 06:23:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 06:23:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 06:23:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 06:23:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-13 06:23:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-13 06:23:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-13 06:23:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-13 06:23:55,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-13 06:23:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-13 06:23:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-13 06:23:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-13 06:23:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-13 06:23:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-13 06:23:55,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2024-10-13 06:23:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:23:55,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:23:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:23:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:23:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:23:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:23:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:23:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:23:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 06:23:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 06:23:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 06:23:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 06:23:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 06:23:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-13 06:23:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-13 06:23:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-13 06:23:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-13 06:23:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-13 06:23:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-13 06:23:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:23:55,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:23:55,802 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:23:55,804 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:23:56,477 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-13 06:23:56,477 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:23:56,530 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:23:56,530 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:23:56,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:23:56 BoogieIcfgContainer [2024-10-13 06:23:56,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:23:56,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:23:56,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:23:56,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:23:56,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:23:54" (1/3) ... [2024-10-13 06:23:56,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebf652a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:23:56, skipping insertion in model container [2024-10-13 06:23:56,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:23:55" (2/3) ... [2024-10-13 06:23:56,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebf652a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:23:56, skipping insertion in model container [2024-10-13 06:23:56,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:23:56" (3/3) ... [2024-10-13 06:23:56,544 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-92.i [2024-10-13 06:23:56,561 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:23:56,562 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:23:56,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:23:56,652 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;@1f126424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:23:56,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:23:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:23:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:23:56,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:56,678 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:23:56,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:56,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:56,686 INFO L85 PathProgramCache]: Analyzing trace with hash -899517309, now seen corresponding path program 1 times [2024-10-13 06:23:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:56,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837066558] [2024-10-13 06:23:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:23:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:23:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:23:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:23:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:23:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:23:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:23:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:23:57,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:57,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837066558] [2024-10-13 06:23:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837066558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:57,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:57,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:23:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340016782] [2024-10-13 06:23:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:57,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:23:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:57,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:23:57,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:23:57,412 INFO L87 Difference]: Start difference. First operand has 106 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:23:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:57,463 INFO L93 Difference]: Finished difference Result 209 states and 329 transitions. [2024-10-13 06:23:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:23:57,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2024-10-13 06:23:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:57,477 INFO L225 Difference]: With dead ends: 209 [2024-10-13 06:23:57,477 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 06:23:57,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-13 06:23:57,489 INFO L432 NwaCegarLoop]: 147 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, 147 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-13 06:23:57,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 06:23:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 06:23:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:23:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-10-13 06:23:57,547 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 148 [2024-10-13 06:23:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:57,548 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-10-13 06:23:57,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:23:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-10-13 06:23:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:23:57,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:57,552 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:23:57,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:23:57,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:57,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 527236705, now seen corresponding path program 1 times [2024-10-13 06:23:57,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:57,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960900866] [2024-10-13 06:23:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:57,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:23:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:23:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:23:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:23:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:23:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:23:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:23:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:23:58,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:58,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960900866] [2024-10-13 06:23:58,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960900866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:58,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:58,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:23:58,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234192434] [2024-10-13 06:23:58,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:58,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:23:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:58,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:23:58,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:23:58,107 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:23:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:58,171 INFO L93 Difference]: Finished difference Result 209 states and 304 transitions. [2024-10-13 06:23:58,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:23:58,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2024-10-13 06:23:58,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:58,174 INFO L225 Difference]: With dead ends: 209 [2024-10-13 06:23:58,174 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 06:23:58,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-13 06:23:58,180 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 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-13 06:23:58,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:23:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 06:23:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 06:23:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:23:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-10-13 06:23:58,196 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 148 [2024-10-13 06:23:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:58,197 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-10-13 06:23:58,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:23:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-10-13 06:23:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:23:58,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:58,202 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:23:58,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:23:58,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:58,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1809155805, now seen corresponding path program 1 times [2024-10-13 06:23:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535875159] [2024-10-13 06:23:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:23:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:23:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:23:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:23:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:23:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:23:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:23:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:23:58,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535875159] [2024-10-13 06:23:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535875159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:23:58,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:23:58,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:23:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460390283] [2024-10-13 06:23:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:23:58,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:23:58,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:23:58,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:23:58,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:23:58,570 INFO L87 Difference]: Start difference. First operand 106 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:23:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:23:58,641 INFO L93 Difference]: Finished difference Result 214 states and 309 transitions. [2024-10-13 06:23:58,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:23:58,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-13 06:23:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:23:58,646 INFO L225 Difference]: With dead ends: 214 [2024-10-13 06:23:58,646 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 06:23:58,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-13 06:23:58,648 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:23:58,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:23:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 06:23:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-10-13 06:23:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:23:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-10-13 06:23:58,667 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 148 [2024-10-13 06:23:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:23:58,668 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-10-13 06:23:58,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:23:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-10-13 06:23:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:23:58,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:23:58,671 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:23:58,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:23:58,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:23:58,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:23:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1809096223, now seen corresponding path program 1 times [2024-10-13 06:23:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:23:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091633730] [2024-10-13 06:23:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:58,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:23:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:23:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:23:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:23:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:23:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:23:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:23:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:23:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:23:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:23:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:23:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:23:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:23:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:23:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:23:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:23:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:23:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:23:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:23:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:23:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:23:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 06:23:59,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:23:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091633730] [2024-10-13 06:23:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091633730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:23:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176185516] [2024-10-13 06:23:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:23:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:23:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:23:59,860 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-13 06:23:59,862 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-13 06:24:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:00,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 06:24:00,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:00,267 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-13 06:24:00,516 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 15 treesize of output 7 [2024-10-13 06:24:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:24:00,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:00,819 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 32 treesize of output 28 [2024-10-13 06:24:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 06:24:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176185516] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:24:00,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 06:24:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2024-10-13 06:24:00,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075225796] [2024-10-13 06:24:00,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 06:24:00,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:24:00,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:00,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:24:00,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:24:00,830 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 12 states, 10 states have (on average 6.9) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 1 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-13 06:24:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:01,257 INFO L93 Difference]: Finished difference Result 221 states and 314 transitions. [2024-10-13 06:24:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:24:01,258 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.9) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 1 states have call predecessors, (38), 3 states have call successors, (38) Word has length 148 [2024-10-13 06:24:01,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:01,260 INFO L225 Difference]: With dead ends: 221 [2024-10-13 06:24:01,260 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 06:24:01,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2024-10-13 06:24:01,262 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 341 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:01,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 635 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:24:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 06:24:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2024-10-13 06:24:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-10-13 06:24:01,283 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 148 [2024-10-13 06:24:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:01,284 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-10-13 06:24:01,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.9) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 1 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-13 06:24:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-10-13 06:24:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:24:01,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:01,286 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:01,307 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-13 06:24:01,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:24:01,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:01,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1668222623, now seen corresponding path program 1 times [2024-10-13 06:24:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:01,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449905527] [2024-10-13 06:24:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:24:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:24:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:24:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:24:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:24:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:24:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:24:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:24:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:24:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:24:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:24:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:24:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:24:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:24:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:02,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449905527] [2024-10-13 06:24:02,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449905527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:02,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:02,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:24:02,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959882464] [2024-10-13 06:24:02,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:02,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:24:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:02,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:24:02,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:24:02,952 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:03,355 INFO L93 Difference]: Finished difference Result 277 states and 389 transitions. [2024-10-13 06:24:03,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:24:03,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-13 06:24:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:03,367 INFO L225 Difference]: With dead ends: 277 [2024-10-13 06:24:03,368 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 06:24:03,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:24:03,372 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 64 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:03,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 904 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:24:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 06:24:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 132. [2024-10-13 06:24:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 110 states have internal predecessors, (147), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2024-10-13 06:24:03,391 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 148 [2024-10-13 06:24:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:03,393 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2024-10-13 06:24:03,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2024-10-13 06:24:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:24:03,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:03,397 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:03,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:24:03,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:03,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash 657105373, now seen corresponding path program 1 times [2024-10-13 06:24:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:03,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870581413] [2024-10-13 06:24:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:24:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:24:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:24:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:24:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:24:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:24:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:24:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:24:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:24:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:24:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:24:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:24:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:24:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:24:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:03,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870581413] [2024-10-13 06:24:03,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870581413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:03,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:03,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:24:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403907085] [2024-10-13 06:24:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:03,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:03,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:24:03,840 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:03,994 INFO L93 Difference]: Finished difference Result 311 states and 431 transitions. [2024-10-13 06:24:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:03,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-13 06:24:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:03,997 INFO L225 Difference]: With dead ends: 311 [2024-10-13 06:24:03,997 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 06:24:03,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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-13 06:24:04,000 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 73 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:04,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 624 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 06:24:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-10-13 06:24:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 149 states have (on average 1.3288590604026846) internal successors, (198), 150 states have internal predecessors, (198), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 06:24:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 244 transitions. [2024-10-13 06:24:04,022 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 244 transitions. Word has length 148 [2024-10-13 06:24:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:04,023 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 244 transitions. [2024-10-13 06:24:04,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 244 transitions. [2024-10-13 06:24:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:24:04,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:04,026 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:04,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:24:04,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:04,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1730262237, now seen corresponding path program 1 times [2024-10-13 06:24:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575634825] [2024-10-13 06:24:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:04,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:24:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:24:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:24:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:24:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:24:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:24:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:24:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:24:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:24:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:24:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:24:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:24:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:24:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:24:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575634825] [2024-10-13 06:24:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575634825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:04,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:04,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:24:04,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472112857] [2024-10-13 06:24:04,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:04,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:04,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:04,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:24:04,424 INFO L87 Difference]: Start difference. First operand 177 states and 244 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:04,581 INFO L93 Difference]: Finished difference Result 360 states and 492 transitions. [2024-10-13 06:24:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:04,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-13 06:24:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:04,586 INFO L225 Difference]: With dead ends: 360 [2024-10-13 06:24:04,587 INFO L226 Difference]: Without dead ends: 184 [2024-10-13 06:24:04,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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-13 06:24:04,589 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 74 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:04,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 598 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-13 06:24:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 136. [2024-10-13 06:24:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 113 states have internal predecessors, (148), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 186 transitions. [2024-10-13 06:24:04,616 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 186 transitions. Word has length 148 [2024-10-13 06:24:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:04,617 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 186 transitions. [2024-10-13 06:24:04,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2024-10-13 06:24:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:24:04,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:04,620 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:04,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:24:04,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:04,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 719144987, now seen corresponding path program 1 times [2024-10-13 06:24:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:04,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132911400] [2024-10-13 06:24:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:24:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:24:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:24:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:24:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:24:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:24:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:24:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:24:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:24:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:24:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:24:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:24:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:24:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:24:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:06,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:06,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132911400] [2024-10-13 06:24:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132911400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:24:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217401330] [2024-10-13 06:24:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:06,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:24:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:06,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:24:06,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:24:06,128 INFO L87 Difference]: Start difference. First operand 136 states and 186 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:06,526 INFO L93 Difference]: Finished difference Result 303 states and 415 transitions. [2024-10-13 06:24:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:24:06,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-13 06:24:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:06,530 INFO L225 Difference]: With dead ends: 303 [2024-10-13 06:24:06,530 INFO L226 Difference]: Without dead ends: 168 [2024-10-13 06:24:06,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:24:06,532 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 59 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:06,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1219 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:24:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-13 06:24:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2024-10-13 06:24:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 183 transitions. [2024-10-13 06:24:06,547 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 183 transitions. Word has length 148 [2024-10-13 06:24:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:06,548 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 183 transitions. [2024-10-13 06:24:06,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 183 transitions. [2024-10-13 06:24:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 06:24:06,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:06,550 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:06,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:24:06,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:06,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:06,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1340422903, now seen corresponding path program 1 times [2024-10-13 06:24:06,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:06,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804704886] [2024-10-13 06:24:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:06,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:24:06,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611700361] [2024-10-13 06:24:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:06,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:24:06,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:24:06,653 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-13 06:24:06,654 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-13 06:24:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:06,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:24:07,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:07,487 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-13 06:24:07,715 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-13 06:24:08,035 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 23 treesize of output 15 [2024-10-13 06:24:08,039 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 22 treesize of output 14 [2024-10-13 06:24:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 499 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-13 06:24:08,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:09,190 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 198 treesize of output 182 [2024-10-13 06:24:09,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#6| c_~var_1_6_Pointer~0.base) c_~var_1_6_Pointer~0.offset)) (.cse6 (= c_~var_1_14_Pointer~0.base |c_~#var_1_14~0.base|)) (.cse0 (= |c_~#var_1_14~0.offset| c_~var_1_14_Pointer~0.offset))) (let ((.cse3 (and .cse6 .cse0)) (.cse4 (not .cse0)) (.cse5 (not .cse6)) (.cse1 (forall ((v_z_7 Int)) (or (< 0 (+ 101 (div .cse2 v_z_7))) (< v_z_7 0) (< 65535 v_z_7) (not (= (mod .cse2 v_z_7) 0)))))) (and (or .cse0 .cse1) (or (forall ((v_z_4 Int)) (or (< 0 (+ 101 (div .cse2 v_z_4))) (< v_z_4 0) (< 65535 v_z_4) (= v_z_4 0))) .cse1 .cse3) (or (< .cse2 0) (forall ((v_z_6 Int)) (or (< 0 (+ 101 (div .cse2 v_z_6))) (< v_z_6 0))) .cse3) (or (and (forall ((v_z_5 Int)) (or (< 65535 v_z_5) (< 0 (+ 102 (div .cse2 v_z_5))) (< v_z_5 0))) (or .cse4 .cse5)) (and .cse6 .cse0 (forall ((v_z_4 Int)) (or (< 0 (+ (div .cse2 v_z_4) 102)) (< v_z_4 0) (< 65535 v_z_4) (= v_z_4 0))))) (or (forall ((v_z_4 Int)) (or (not (= (mod .cse2 v_z_4) 0)) (< 0 (+ 101 (div .cse2 v_z_4))) (< v_z_4 0) (< 65535 v_z_4) (= v_z_4 0))) .cse4 .cse5) (or .cse6 .cse1)))) is different from false [2024-10-13 06:24:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:09,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804704886] [2024-10-13 06:24:09,738 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:24:09,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611700361] [2024-10-13 06:24:09,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611700361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:09,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:24:09,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-10-13 06:24:09,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98416968] [2024-10-13 06:24:09,739 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 06:24:09,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:24:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:09,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:24:09,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=315, Unknown=1, NotChecked=36, Total=420 [2024-10-13 06:24:09,741 INFO L87 Difference]: Start difference. First operand 134 states and 183 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 5 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-10-13 06:24:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:10,621 INFO L93 Difference]: Finished difference Result 279 states and 375 transitions. [2024-10-13 06:24:10,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 06:24:10,622 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 5 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 152 [2024-10-13 06:24:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:10,623 INFO L225 Difference]: With dead ends: 279 [2024-10-13 06:24:10,623 INFO L226 Difference]: Without dead ends: 146 [2024-10-13 06:24:10,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=262, Invalid=931, Unknown=1, NotChecked=66, Total=1260 [2024-10-13 06:24:10,625 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 265 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 76 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:10,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 762 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:24:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-13 06:24:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2024-10-13 06:24:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 117 states have internal predecessors, (149), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 187 transitions. [2024-10-13 06:24:10,640 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 187 transitions. Word has length 152 [2024-10-13 06:24:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:10,640 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 187 transitions. [2024-10-13 06:24:10,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 5 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-10-13 06:24:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 187 transitions. [2024-10-13 06:24:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:24:10,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:10,642 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:10,665 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-13 06:24:10,846 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,SelfDestructingSolverStorable8 [2024-10-13 06:24:10,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:10,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:10,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1640382301, now seen corresponding path program 1 times [2024-10-13 06:24:10,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:10,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351793612] [2024-10-13 06:24:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:24:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:24:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:24:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:24:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:24:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:24:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:24:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:24:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:24:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:24:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:24:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:24:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:24:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:24:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 06:24:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351793612] [2024-10-13 06:24:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351793612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:11,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:11,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:24:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512839708] [2024-10-13 06:24:11,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:11,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:24:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:11,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:24:11,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:24:11,660 INFO L87 Difference]: Start difference. First operand 142 states and 187 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-13 06:24:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:12,148 INFO L93 Difference]: Finished difference Result 293 states and 382 transitions. [2024-10-13 06:24:12,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:24:12,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 154 [2024-10-13 06:24:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:12,151 INFO L225 Difference]: With dead ends: 293 [2024-10-13 06:24:12,151 INFO L226 Difference]: Without dead ends: 152 [2024-10-13 06:24:12,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2024-10-13 06:24:12,153 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 300 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:12,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 615 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:24:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-13 06:24:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2024-10-13 06:24:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.25) internal successors, (150), 120 states have internal predecessors, (150), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2024-10-13 06:24:12,171 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 154 [2024-10-13 06:24:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:12,171 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2024-10-13 06:24:12,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-13 06:24:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2024-10-13 06:24:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 06:24:12,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:12,174 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:12,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:24:12,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1654485224, now seen corresponding path program 1 times [2024-10-13 06:24:12,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:12,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331977670] [2024-10-13 06:24:12,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:24:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:24:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:24:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:24:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:24:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:24:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:24:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:24:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:24:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:24:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:24:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:24:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:24:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:24:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 06:24:12,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331977670] [2024-10-13 06:24:12,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331977670] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:12,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866371442] [2024-10-13 06:24:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:12,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:24:12,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:24:12,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:24:12,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 06:24:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:13,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 06:24:13,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:13,653 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-13 06:24:13,855 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 35 treesize of output 23 [2024-10-13 06:24:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-13 06:24:13,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:14,030 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 27 treesize of output 23 [2024-10-13 06:24:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 06:24:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866371442] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:24:14,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 06:24:14,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2024-10-13 06:24:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757704301] [2024-10-13 06:24:14,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 06:24:14,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 06:24:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 06:24:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:24:14,188 INFO L87 Difference]: Start difference. First operand 146 states and 188 transitions. Second operand has 19 states, 16 states have (on average 7.3125) internal successors, (117), 18 states have internal predecessors, (117), 9 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-13 06:24:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:14,578 INFO L93 Difference]: Finished difference Result 301 states and 384 transitions. [2024-10-13 06:24:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:24:14,580 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.3125) internal successors, (117), 18 states have internal predecessors, (117), 9 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 9 states have call successors, (40) Word has length 156 [2024-10-13 06:24:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:14,582 INFO L225 Difference]: With dead ends: 301 [2024-10-13 06:24:14,582 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 06:24:14,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2024-10-13 06:24:14,584 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 260 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:14,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 610 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:24:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 06:24:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2024-10-13 06:24:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.2276422764227641) internal successors, (151), 123 states have internal predecessors, (151), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2024-10-13 06:24:14,607 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 156 [2024-10-13 06:24:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:14,607 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2024-10-13 06:24:14,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.3125) internal successors, (117), 18 states have internal predecessors, (117), 9 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-13 06:24:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2024-10-13 06:24:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 06:24:14,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:14,611 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:14,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 06:24:14,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:24:14,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:14,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1795033834, now seen corresponding path program 1 times [2024-10-13 06:24:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:14,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767255402] [2024-10-13 06:24:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:24:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [358580499] [2024-10-13 06:24:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:14,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:24:14,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:24:14,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:24:14,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 06:24:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:24:15,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:24:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:24:16,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:24:16,334 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:24:16,335 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:24:16,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 06:24:16,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:24:16,542 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:16,789 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:24:16,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:24:16 BoogieIcfgContainer [2024-10-13 06:24:16,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:24:16,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:24:16,793 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:24:16,793 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:24:16,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:23:56" (3/4) ... [2024-10-13 06:24:16,796 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:24:16,797 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:24:16,798 INFO L158 Benchmark]: Toolchain (without parser) took 22001.69ms. Allocated memory was 119.5MB in the beginning and 446.7MB in the end (delta: 327.2MB). Free memory was 51.4MB in the beginning and 334.4MB in the end (delta: -283.0MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2024-10-13 06:24:16,798 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory was 79.9MB in the beginning and 79.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:24:16,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.20ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 51.3MB in the beginning and 123.1MB in the end (delta: -71.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-13 06:24:16,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.14ms. Allocated memory is still 161.5MB. Free memory was 123.1MB in the beginning and 118.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:24:16,799 INFO L158 Benchmark]: Boogie Preprocessor took 117.09ms. Allocated memory is still 161.5MB. Free memory was 118.9MB in the beginning and 113.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:24:16,799 INFO L158 Benchmark]: RCFGBuilder took 1088.54ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 62.3MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-13 06:24:16,800 INFO L158 Benchmark]: TraceAbstraction took 20258.21ms. Allocated memory was 161.5MB in the beginning and 446.7MB in the end (delta: 285.2MB). Free memory was 62.3MB in the beginning and 334.4MB in the end (delta: -272.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-10-13 06:24:16,800 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 446.7MB. Free memory is still 334.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:24:16,803 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.17ms. Allocated memory is still 119.5MB. Free memory was 79.9MB in the beginning and 79.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.20ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 51.3MB in the beginning and 123.1MB in the end (delta: -71.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.14ms. Allocated memory is still 161.5MB. Free memory was 123.1MB in the beginning and 118.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.09ms. Allocated memory is still 161.5MB. Free memory was 118.9MB in the beginning and 113.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1088.54ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 62.3MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20258.21ms. Allocated memory was 161.5MB in the beginning and 446.7MB in the end (delta: 285.2MB). Free memory was 62.3MB in the beginning and 334.4MB in the end (delta: -272.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 446.7MB. Free memory is still 334.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L22] signed char var_1_1 = 32; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] signed char var_1_2 = 2; [L24] signed char var_1_2 = 2; [L25] signed char* var_1_2_Pointer = &(var_1_2); [L26] signed char var_1_3 = 8; [L26] signed char var_1_3 = 8; [L27] signed char* var_1_3_Pointer = &(var_1_3); [L28] signed char var_1_4 = 0; [L28] signed char var_1_4 = 0; [L29] signed char* var_1_4_Pointer = &(var_1_4); [L30] signed char var_1_5 = 32; [L30] signed char var_1_5 = 32; [L31] signed char* var_1_5_Pointer = &(var_1_5); [L32] signed char var_1_6 = 10; [L32] signed char var_1_6 = 10; [L33] signed char* var_1_6_Pointer = &(var_1_6); [L34] double var_1_7 = 1000000.625; [L34] double var_1_7 = 1000000.625; [L35] double* var_1_7_Pointer = &(var_1_7); [L36] double var_1_8 = 16.65; [L36] double var_1_8 = 16.65; [L37] double* var_1_8_Pointer = &(var_1_8); [L38] double var_1_9 = 15.5; [L38] double var_1_9 = 15.5; [L39] double* var_1_9_Pointer = &(var_1_9); [L40] signed short int var_1_10 = 500; [L40] signed short int var_1_10 = 500; [L41] signed short int* var_1_10_Pointer = &(var_1_10); [L42] unsigned short int var_1_11 = 8; [L42] unsigned short int var_1_11 = 8; [L43] unsigned short int* var_1_11_Pointer = &(var_1_11); [L44] unsigned char var_1_13 = 0; [L44] unsigned char var_1_13 = 0; [L45] unsigned char* var_1_13_Pointer = &(var_1_13); [L46] unsigned short int var_1_14 = 100; [L46] unsigned short int var_1_14 = 100; [L47] unsigned short int* var_1_14_Pointer = &(var_1_14); [L48] unsigned char var_1_15 = 0; [L48] unsigned char var_1_15 = 0; [L49] unsigned char* var_1_15_Pointer = &(var_1_15); [L50] unsigned char var_1_16 = 0; [L50] unsigned char var_1_16 = 0; [L51] unsigned char* var_1_16_Pointer = &(var_1_16); [L52] float var_1_17 = 2.4; [L52] float var_1_17 = 2.4; [L53] float* var_1_17_Pointer = &(var_1_17); [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] FCALL updateLastVariables() [L118] CALL updateVariables() [L77] var_1_2 = __VERIFIER_nondet_char() [L78] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L78] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L78] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L79] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L79] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L79] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L80] var_1_3 = __VERIFIER_nondet_char() [L81] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L81] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L81] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L82] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L82] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L82] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L83] var_1_4 = __VERIFIER_nondet_char() [L84] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L84] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L84] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] var_1_5 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] var_1_6 = __VERIFIER_nondet_char() [L90] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] var_1_8 = __VERIFIER_nondet_double() [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L94] var_1_9 = __VERIFIER_nondet_double() [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] var_1_14 = __VERIFIER_nondet_ushort() [L97] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] CALL assume_abort_if_not(var_1_14 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] RET assume_abort_if_not(var_1_14 <= 65535) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L100] var_1_15 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] var_1_16 = __VERIFIER_nondet_uchar() [L104] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L118] RET updateVariables() [L119] CALL step() [L57] EXPR \read(*var_1_2_Pointer) [L57] EXPR \read(*var_1_3_Pointer) [L57] EXPR \read(*var_1_4_Pointer) [L57] EXPR \read(*var_1_5_Pointer) [L57] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L57] EXPR (((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer)))) [L57] EXPR \read(*var_1_4_Pointer) [L57] EXPR (((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L57] (*(var_1_1_Pointer)) = (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))) [L58] EXPR \read(*var_1_5_Pointer) [L58] EXPR \read(*var_1_6_Pointer) [L58] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L58] EXPR (*(var_1_6_Pointer)) & (*(var_1_3_Pointer)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L58] signed long int stepLocal_0 = (~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer))); [L59] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L59] COND FALSE !(stepLocal_0 >= (*(var_1_4_Pointer))) [L62] EXPR \read(*var_1_9_Pointer) [L62] (*(var_1_7_Pointer)) = (*(var_1_9_Pointer)) [L64] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L64] EXPR (((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer))) [L64] EXPR \read(*var_1_2_Pointer) [L64] EXPR (((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L64] (*(var_1_10_Pointer)) = (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer))))) [L65] EXPR \read(*var_1_6_Pointer) [L65] EXPR \read(*var_1_14_Pointer) [L65] signed long int stepLocal_1 = (*(var_1_6_Pointer)) / (*(var_1_14_Pointer)); [L66] COND FALSE !(stepLocal_1 < -100) [L69] EXPR \read(*var_1_15_Pointer) [L69] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L69] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L69] (*(var_1_13_Pointer)) = ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))) [L71] EXPR \read(*var_1_8_Pointer) [L71] (*(var_1_17_Pointer)) = (*(var_1_8_Pointer)) [L72] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L72] COND TRUE ! (*(var_1_13_Pointer)) [L73] EXPR \read(*var_1_5_Pointer) [L73] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L73] EXPR (((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1) [L73] EXPR \read(*var_1_6_Pointer) [L73] EXPR (((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L73] (*(var_1_11_Pointer)) = ((*(var_1_5_Pointer)) + ((((((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1))) + 64)) [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR \read(*var_1_1_Pointer) [L110] EXPR \read(*var_1_2_Pointer) [L110] EXPR \read(*var_1_3_Pointer) [L110] EXPR \read(*var_1_4_Pointer) [L110] EXPR \read(*var_1_5_Pointer) [L110] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR (((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer)))) [L110] EXPR \read(*var_1_4_Pointer) [L110] EXPR (((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR ((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR ((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer))))) [L110] EXPR \read(*var_1_5_Pointer) [L110] EXPR \read(*var_1_6_Pointer) [L110] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR (*(var_1_6_Pointer)) & (*(var_1_3_Pointer)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR (((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))) [L110] EXPR \read(*var_1_7_Pointer) [L110] EXPR \read(*var_1_9_Pointer) [L110] EXPR (((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR ((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR (((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))))) && ((*(var_1_10_Pointer)) == ((signed short int) (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR (((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))))) && ((*(var_1_10_Pointer)) == ((signed short int) (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR ((((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))))) && ((*(var_1_10_Pointer)) == ((signed short int) (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned short int) ((*(var_1_5_Pointer)) + ((((((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1))) + 64)))) : 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR ((((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))))) && ((*(var_1_10_Pointer)) == ((signed short int) (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned short int) ((*(var_1_5_Pointer)) + ((((((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1))) + 64)))) : 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR (((((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))))) && ((*(var_1_10_Pointer)) == ((signed short int) (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned short int) ((*(var_1_5_Pointer)) + ((((((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1))) + 64)))) : 1)) && ((((*(var_1_6_Pointer)) / (*(var_1_14_Pointer))) < -100) ? ((*(var_1_13_Pointer)) == ((unsigned char) (! (! (! (*(var_1_15_Pointer))))))) : ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR (((((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))))) && ((*(var_1_10_Pointer)) == ((signed short int) (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned short int) ((*(var_1_5_Pointer)) + ((((((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1))) + 64)))) : 1)) && ((((*(var_1_6_Pointer)) / (*(var_1_14_Pointer))) < -100) ? ((*(var_1_13_Pointer)) == ((unsigned char) (! (! (! (*(var_1_15_Pointer))))))) : ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR ((((((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))))) && ((*(var_1_10_Pointer)) == ((signed short int) (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned short int) ((*(var_1_5_Pointer)) + ((((((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1))) + 64)))) : 1)) && ((((*(var_1_6_Pointer)) / (*(var_1_14_Pointer))) < -100) ? ((*(var_1_13_Pointer)) == ((unsigned char) (! (! (! (*(var_1_15_Pointer))))))) : ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR ((((((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))))) && ((*(var_1_10_Pointer)) == ((signed short int) (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned short int) ((*(var_1_5_Pointer)) + ((((((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1))) + 64)))) : 1)) && ((((*(var_1_6_Pointer)) / (*(var_1_14_Pointer))) < -100) ? ((*(var_1_13_Pointer)) == ((unsigned char) (! (! (! (*(var_1_15_Pointer))))))) : ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110-L111] return ((((((*(var_1_1_Pointer)) == ((signed char) (((*(var_1_2_Pointer)) + (*(var_1_3_Pointer))) - (((((*(var_1_4_Pointer))) > (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))) ? ((*(var_1_4_Pointer))) : (((*(var_1_5_Pointer)) + (*(var_1_6_Pointer))))))))) && ((((~ (*(var_1_5_Pointer))) * ((*(var_1_6_Pointer)) & (*(var_1_3_Pointer)))) >= (*(var_1_4_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_8_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_9_Pointer)))))) && ((*(var_1_10_Pointer)) == ((signed short int) (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned short int) ((*(var_1_5_Pointer)) + ((((((*(var_1_6_Pointer))) > (1)) ? ((*(var_1_6_Pointer))) : (1))) + 64)))) : 1)) && ((((*(var_1_6_Pointer)) / (*(var_1_14_Pointer))) < -100) ? ((*(var_1_13_Pointer)) == ((unsigned char) (! (! (! (*(var_1_15_Pointer))))))) : ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_8_Pointer)))) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 12, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1437 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1437 mSDsluCounter, 6970 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5410 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1954 IncrementalHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 1560 mSDtfsCounter, 1954 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1346 GetRequests, 1212 SyntacticMatches, 2 SemanticMatches, 132 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=6, InterpolantAutomatonStates: 94, 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, 11 MinimizatonAttempts, 138 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 2414 NumberOfCodeBlocks, 2414 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2239 ConstructedInterpolants, 1 QuantifiedInterpolants, 11135 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2079 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 9389/10260 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-13 06:24:16,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-p_file-92.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 e0591871f2ff833ee138d20870c79176760037c48f330bc5791f7462916d2248 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:24:19,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:24:19,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:24:19,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:24:19,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:24:19,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:24:19,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:24:19,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:24:19,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:24:19,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:24:19,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:24:19,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:24:19,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:24:19,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:24:19,423 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:24:19,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:24:19,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:24:19,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:24:19,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:24:19,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:24:19,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:24:19,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:24:19,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:24:19,431 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:24:19,431 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:24:19,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:24:19,432 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:24:19,432 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:24:19,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:24:19,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:24:19,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:24:19,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:24:19,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:24:19,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:24:19,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:19,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:24:19,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:24:19,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:24:19,437 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:24:19,437 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:24:19,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:24:19,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:24:19,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:24:19,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:24:19,438 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:24:19,438 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 -> e0591871f2ff833ee138d20870c79176760037c48f330bc5791f7462916d2248 [2024-10-13 06:24:19,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:24:19,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:24:19,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:24:19,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:24:19,850 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:24:19,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-92.i [2024-10-13 06:24:21,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:24:21,753 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:24:21,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-92.i [2024-10-13 06:24:21,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5075a67/09c0897edf45411f996b2cd83a955ad2/FLAGe0c049967 [2024-10-13 06:24:22,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5075a67/09c0897edf45411f996b2cd83a955ad2 [2024-10-13 06:24:22,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:24:22,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:24:22,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:22,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:24:22,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:24:22,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704aef20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22, skipping insertion in model container [2024-10-13 06:24:22,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:24:22,359 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-p_file-92.i[916,929] [2024-10-13 06:24:22,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:22,463 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:24:22,478 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-p_file-92.i[916,929] [2024-10-13 06:24:22,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:22,562 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:24:22,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22 WrapperNode [2024-10-13 06:24:22,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:22,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:22,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:24:22,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:24:22,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,649 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2024-10-13 06:24:22,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:22,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:24:22,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:24:22,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:24:22,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,747 INFO L175 MemorySlicer]: Split 123 memory accesses to 17 slices as follows [2, 3, 12, 8, 10, 12, 16, 5, 10, 8, 3, 3, 7, 7, 8, 6, 3]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1]. [2024-10-13 06:24:22,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:24:22,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:24:22,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:24:22,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:24:22,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (1/1) ... [2024-10-13 06:24:22,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:22,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:24:22,889 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-13 06:24:22,893 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-13 06:24:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:24:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:24:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:24:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-13 06:24:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-13 06:24:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-13 06:24:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-13 06:24:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-13 06:24:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-13 06:24:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-13 06:24:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-13 06:24:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-13 06:24:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-10-13 06:24:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-10-13 06:24:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-10-13 06:24:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-10-13 06:24:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2024-10-13 06:24:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#16 [2024-10-13 06:24:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:24:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:24:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-13 06:24:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-13 06:24:22,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-13 06:24:22,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-13 06:24:22,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-13 06:24:22,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-13 06:24:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-13 06:24:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-13 06:24:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-13 06:24:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-10-13 06:24:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-10-13 06:24:22,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-10-13 06:24:22,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-10-13 06:24:22,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2024-10-13 06:24:22,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#16 [2024-10-13 06:24:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:24:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:24:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 06:24:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 06:24:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 06:24:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-13 06:24:22,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-13 06:24:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-13 06:24:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-13 06:24:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-13 06:24:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-13 06:24:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-13 06:24:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-13 06:24:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-13 06:24:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-13 06:24:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-13 06:24:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2024-10-13 06:24:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:24:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:24:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 06:24:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 06:24:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-13 06:24:22,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-13 06:24:22,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-13 06:24:22,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-13 06:24:22,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-13 06:24:22,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-13 06:24:22,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-13 06:24:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-13 06:24:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-13 06:24:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-13 06:24:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-13 06:24:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-13 06:24:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2024-10-13 06:24:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:24:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:24:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 06:24:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 06:24:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 06:24:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-13 06:24:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-13 06:24:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-13 06:24:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-13 06:24:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-13 06:24:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-13 06:24:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-13 06:24:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-13 06:24:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-13 06:24:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-13 06:24:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-13 06:24:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2024-10-13 06:24:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:24:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:24:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-13 06:24:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-13 06:24:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-13 06:24:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-13 06:24:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-13 06:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-13 06:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-13 06:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-13 06:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-13 06:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-13 06:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-13 06:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-13 06:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-13 06:24:22,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-13 06:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2024-10-13 06:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-13 06:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-13 06:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-13 06:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-13 06:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-13 06:24:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-13 06:24:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-13 06:24:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-13 06:24:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-13 06:24:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-10-13 06:24:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-10-13 06:24:22,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-10-13 06:24:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-10-13 06:24:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2024-10-13 06:24:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#16 [2024-10-13 06:24:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:24:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:24:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 06:24:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 06:24:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-13 06:24:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-13 06:24:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-13 06:24:22,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2024-10-13 06:24:22,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:24:22,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:24:22,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-13 06:24:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-13 06:24:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-13 06:24:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-13 06:24:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-13 06:24:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-13 06:24:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-13 06:24:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-13 06:24:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-13 06:24:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-13 06:24:22,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-13 06:24:22,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-13 06:24:22,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-13 06:24:22,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-13 06:24:22,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2024-10-13 06:24:22,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:24:22,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:24:22,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-13 06:24:22,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-13 06:24:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-13 06:24:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-13 06:24:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-13 06:24:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-13 06:24:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-13 06:24:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-13 06:24:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-13 06:24:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-13 06:24:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-13 06:24:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-13 06:24:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-13 06:24:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-13 06:24:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2024-10-13 06:24:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:24:22,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:24:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:24:22,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 06:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 06:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 06:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-13 06:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-13 06:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-13 06:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-13 06:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-13 06:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-13 06:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-13 06:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-13 06:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-13 06:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-13 06:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-13 06:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2024-10-13 06:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 06:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 06:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-13 06:24:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-13 06:24:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-13 06:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-13 06:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-13 06:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-13 06:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-13 06:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-13 06:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-13 06:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-13 06:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-13 06:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-13 06:24:22,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2024-10-13 06:24:23,297 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:24:23,300 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:24:24,335 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-13 06:24:24,335 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:24:24,403 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:24:24,404 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:24:24,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:24 BoogieIcfgContainer [2024-10-13 06:24:24,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:24:24,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:24:24,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:24:24,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:24:24,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:24:22" (1/3) ... [2024-10-13 06:24:24,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f461f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:24:24, skipping insertion in model container [2024-10-13 06:24:24,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:22" (2/3) ... [2024-10-13 06:24:24,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f461f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:24:24, skipping insertion in model container [2024-10-13 06:24:24,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:24" (3/3) ... [2024-10-13 06:24:24,414 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-92.i [2024-10-13 06:24:24,431 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:24:24,432 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:24:24,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:24:24,515 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;@2afe4e9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:24:24,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:24:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:24:24,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:24,535 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:24,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:24,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1053809131, now seen corresponding path program 1 times [2024-10-13 06:24:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:24,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80750026] [2024-10-13 06:24:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:24,556 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-13 06:24:24,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:24,558 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-13 06:24:24,575 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-13 06:24:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:25,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:24:25,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-13 06:24:25,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:25,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80750026] [2024-10-13 06:24:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80750026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:25,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:24:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44891692] [2024-10-13 06:24:25,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:25,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:24:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:24:25,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:24:25,243 INFO L87 Difference]: Start difference. First operand has 98 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:25,309 INFO L93 Difference]: Finished difference Result 193 states and 305 transitions. [2024-10-13 06:24:25,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:24:25,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2024-10-13 06:24:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:25,322 INFO L225 Difference]: With dead ends: 193 [2024-10-13 06:24:25,323 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 06:24:25,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-13 06:24:25,334 INFO L432 NwaCegarLoop]: 135 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, 135 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-13 06:24:25,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:24:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 06:24:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 06:24:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2024-10-13 06:24:25,395 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 146 [2024-10-13 06:24:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:25,396 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2024-10-13 06:24:25,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2024-10-13 06:24:25,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:24:25,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:25,414 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:25,432 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-13 06:24:25,615 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-13 06:24:25,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:25,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:25,617 INFO L85 PathProgramCache]: Analyzing trace with hash -395341965, now seen corresponding path program 1 times [2024-10-13 06:24:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:25,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076131871] [2024-10-13 06:24:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:25,619 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-13 06:24:25,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:25,622 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-13 06:24:25,624 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-13 06:24:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:26,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:24:26,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-13 06:24:26,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:26,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:26,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076131871] [2024-10-13 06:24:26,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076131871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:26,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:26,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:24:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841286314] [2024-10-13 06:24:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:26,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:24:26,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:26,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:24:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:26,338 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:26,463 INFO L93 Difference]: Finished difference Result 193 states and 280 transitions. [2024-10-13 06:24:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:24:26,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2024-10-13 06:24:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:26,465 INFO L225 Difference]: With dead ends: 193 [2024-10-13 06:24:26,465 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 06:24:26,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 143 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-13 06:24:26,467 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 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-13 06:24:26,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 06:24:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-13 06:24:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2024-10-13 06:24:26,484 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 146 [2024-10-13 06:24:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:26,486 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2024-10-13 06:24:26,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2024-10-13 06:24:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:24:26,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:26,490 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:26,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:26,694 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-13 06:24:26,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:26,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1483788981, now seen corresponding path program 1 times [2024-10-13 06:24:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:26,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808333742] [2024-10-13 06:24:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:26,697 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-13 06:24:26,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:26,701 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-13 06:24:26,702 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-13 06:24:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:27,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:24:27,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:27,627 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 18 treesize of output 10 [2024-10-13 06:24:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:24:27,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:28,255 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 06:24:28,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-10-13 06:24:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 06:24:28,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:28,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808333742] [2024-10-13 06:24:28,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808333742] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:24:28,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:24:28,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-10-13 06:24:28,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297749845] [2024-10-13 06:24:28,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:24:28,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:24:28,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:28,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:24:28,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:24:28,278 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 1 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-13 06:24:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:29,481 INFO L93 Difference]: Finished difference Result 201 states and 286 transitions. [2024-10-13 06:24:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:24:29,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 1 states have call predecessors, (38), 3 states have call successors, (38) Word has length 146 [2024-10-13 06:24:29,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:29,484 INFO L225 Difference]: With dead ends: 201 [2024-10-13 06:24:29,484 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 06:24:29,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:24:29,487 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 234 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:29,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 481 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:24:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 06:24:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-10-13 06:24:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-10-13 06:24:29,513 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 146 [2024-10-13 06:24:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:29,514 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-10-13 06:24:29,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 1 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-13 06:24:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-10-13 06:24:29,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:24:29,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:29,519 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:29,544 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-13 06:24:29,719 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-13 06:24:29,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:29,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 666140531, now seen corresponding path program 1 times [2024-10-13 06:24:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:29,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974455041] [2024-10-13 06:24:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:29,722 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-13 06:24:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:29,727 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-13 06:24:29,728 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-13 06:24:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:30,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 06:24:30,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:32,015 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 27 treesize of output 19 [2024-10-13 06:24:32,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-10-13 06:24:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 499 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-13 06:24:32,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:34,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:34,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-10-13 06:24:35,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974455041] [2024-10-13 06:24:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974455041] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1417009037] [2024-10-13 06:24:35,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:35,671 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:24:35,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:24:35,672 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:24:35,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-13 06:24:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:36,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:24:36,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:36,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1417009037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:36,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:24:36,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2024-10-13 06:24:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085129800] [2024-10-13 06:24:36,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:36,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:24:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:36,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:24:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2024-10-13 06:24:36,703 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:36,968 INFO L93 Difference]: Finished difference Result 212 states and 298 transitions. [2024-10-13 06:24:36,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:24:36,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2024-10-13 06:24:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:36,970 INFO L225 Difference]: With dead ends: 212 [2024-10-13 06:24:36,970 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 06:24:36,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2024-10-13 06:24:36,975 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:36,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 740 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:24:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 06:24:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-13 06:24:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 151 transitions. [2024-10-13 06:24:36,995 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 151 transitions. Word has length 146 [2024-10-13 06:24:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:36,997 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 151 transitions. [2024-10-13 06:24:36,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2024-10-13 06:24:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:24:36,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:37,000 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:37,019 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-13 06:24:37,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:37,400 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 06:24:37,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 666200113, now seen corresponding path program 1 times [2024-10-13 06:24:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:37,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905131227] [2024-10-13 06:24:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:37,402 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-13 06:24:37,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:37,404 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-13 06:24:37,405 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-13 06:24:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:37,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 06:24:37,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:39,225 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 27 treesize of output 19 [2024-10-13 06:24:39,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-10-13 06:24:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 499 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-13 06:24:39,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:41,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:41,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-10-13 06:24:42,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:42,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905131227] [2024-10-13 06:24:42,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905131227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:42,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [51384723] [2024-10-13 06:24:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:24:42,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:24:42,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:24:42,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-13 06:24:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:43,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 06:24:43,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:44,973 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-13 06:24:46,122 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-13 06:24:47,823 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 27 treesize of output 19 [2024-10-13 06:24:47,828 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 32 treesize of output 20 [2024-10-13 06:24:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 499 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-13 06:24:48,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:50,516 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 51 treesize of output 47 [2024-10-13 06:24:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [51384723] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:51,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:24:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2024-10-13 06:24:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426857738] [2024-10-13 06:24:51,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:24:51,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 06:24:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:51,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 06:24:51,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 06:24:51,318 INFO L87 Difference]: Start difference. First operand 110 states and 151 transitions. Second operand has 26 states, 22 states have (on average 5.318181818181818) internal successors, (117), 21 states have internal predecessors, (117), 11 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 7 states have call predecessors, (38), 11 states have call successors, (38) [2024-10-13 06:24:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:56,252 INFO L93 Difference]: Finished difference Result 235 states and 314 transitions. [2024-10-13 06:24:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 06:24:56,253 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 5.318181818181818) internal successors, (117), 21 states have internal predecessors, (117), 11 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 7 states have call predecessors, (38), 11 states have call successors, (38) Word has length 146 [2024-10-13 06:24:56,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:56,254 INFO L225 Difference]: With dead ends: 235 [2024-10-13 06:24:56,254 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 06:24:56,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=594, Invalid=1956, Unknown=0, NotChecked=0, Total=2550 [2024-10-13 06:24:56,257 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 627 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:56,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 998 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 06:24:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 06:24:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-10-13 06:24:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 97 states have internal predecessors, (121), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2024-10-13 06:24:56,293 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 159 transitions. Word has length 146 [2024-10-13 06:24:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:56,293 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 159 transitions. [2024-10-13 06:24:56,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 5.318181818181818) internal successors, (117), 21 states have internal predecessors, (117), 11 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 7 states have call predecessors, (38), 11 states have call successors, (38) [2024-10-13 06:24:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2024-10-13 06:24:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:24:56,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:56,296 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:56,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:56,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:56,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 06:24:56,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:56,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:56,698 INFO L85 PathProgramCache]: Analyzing trace with hash 775991979, now seen corresponding path program 1 times [2024-10-13 06:24:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055212071] [2024-10-13 06:24:56,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:56,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:24:56,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:56,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:24:56,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 06:24:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:57,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:24:57,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:57,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-13 06:24:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-13 06:24:57,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:57,742 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 06:24:57,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-10-13 06:24:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 06:24:57,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:57,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055212071] [2024-10-13 06:24:57,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055212071] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:24:57,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:24:57,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-10-13 06:24:57,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328335232] [2024-10-13 06:24:57,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:24:57,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:24:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:57,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:24:57,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:24:57,982 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. Second operand has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2024-10-13 06:24:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:58,475 INFO L93 Difference]: Finished difference Result 253 states and 326 transitions. [2024-10-13 06:24:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:24:58,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) Word has length 148 [2024-10-13 06:24:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:58,482 INFO L225 Difference]: With dead ends: 253 [2024-10-13 06:24:58,482 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 06:24:58,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:24:58,483 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 242 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:58,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 465 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:24:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 06:24:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-10-13 06:24:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 161 transitions. [2024-10-13 06:24:58,516 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 161 transitions. Word has length 148 [2024-10-13 06:24:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:58,517 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-10-13 06:24:58,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2024-10-13 06:24:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 161 transitions. [2024-10-13 06:24:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:24:58,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:58,519 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:58,538 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 (9)] Ended with exit code 0 [2024-10-13 06:24:58,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:24:58,720 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:58,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash -912951763, now seen corresponding path program 1 times [2024-10-13 06:24:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:58,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410988479] [2024-10-13 06:24:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:58,721 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-13 06:24:58,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:58,723 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:24:58,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 06:24:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:59,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 06:24:59,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:59,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-13 06:24:59,716 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-13 06:24:59,740 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-13 06:24:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-13 06:24:59,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:59,962 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 06:24:59,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-10-13 06:25:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 06:25:00,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:00,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410988479] [2024-10-13 06:25:00,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410988479] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:25:00,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:25:00,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-10-13 06:25:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89178229] [2024-10-13 06:25:00,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:25:00,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:25:00,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:00,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:25:00,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:25:00,167 INFO L87 Difference]: Start difference. First operand 126 states and 161 transitions. Second operand has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2024-10-13 06:25:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:00,918 INFO L93 Difference]: Finished difference Result 257 states and 327 transitions. [2024-10-13 06:25:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:25:00,923 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) Word has length 148 [2024-10-13 06:25:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:00,924 INFO L225 Difference]: With dead ends: 257 [2024-10-13 06:25:00,925 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 06:25:00,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-10-13 06:25:00,926 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 356 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:00,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 545 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:25:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 06:25:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-10-13 06:25:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 100 states have (on average 1.22) internal successors, (122), 100 states have internal predecessors, (122), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions. [2024-10-13 06:25:00,948 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 160 transitions. Word has length 148 [2024-10-13 06:25:00,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:00,948 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 160 transitions. [2024-10-13 06:25:00,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2024-10-13 06:25:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2024-10-13 06:25:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 06:25:00,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:00,951 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:00,966 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 (10)] Ended with exit code 0 [2024-10-13 06:25:01,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:25:01,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:01,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash -759123374, now seen corresponding path program 1 times [2024-10-13 06:25:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777200960] [2024-10-13 06:25:01,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:01,153 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-13 06:25:01,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:01,155 INFO L229 MonitoredProcess]: Starting monitored process 11 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-13 06:25:01,156 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 (11)] Waiting until timeout for monitored process [2024-10-13 06:25:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:01,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-13 06:25:01,743 INFO L278 TraceCheckSpWp]: Computing forward predicates...