./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.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 0f58e05e69aba02ac6d50b38841a74177f33dc95d4d7184ac65f3b02be95b15d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:52:24,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:52:24,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:52:24,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:52:24,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:52:24,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:52:24,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:52:24,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:52:24,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:52:24,803 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:52:24,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:52:24,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:52:24,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:52:24,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:52:24,807 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:52:24,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:52:24,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:52:24,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:52:24,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:52:24,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:52:24,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:52:24,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:52:24,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:52:24,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:52:24,812 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:52:24,812 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:52:24,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:52:24,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:52:24,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:52:24,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:52:24,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:52:24,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:52:24,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:52:24,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:52:24,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:52:24,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:52:24,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:52:24,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:52:24,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:52:24,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:52:24,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:52:24,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:52:24,815 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 -> 0f58e05e69aba02ac6d50b38841a74177f33dc95d4d7184ac65f3b02be95b15d [2024-11-09 01:52:25,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:52:25,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:52:25,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:52:25,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:52:25,067 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:52:25,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.i [2024-11-09 01:52:26,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:52:26,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:52:26,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.i [2024-11-09 01:52:26,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50a54d70/c1b630ea1dbf4adc98a0f1eb61dd7d5c/FLAGa5f0cef4a [2024-11-09 01:52:27,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50a54d70/c1b630ea1dbf4adc98a0f1eb61dd7d5c [2024-11-09 01:52:27,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:52:27,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:52:27,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:52:27,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:52:27,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:52:27,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2b9a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27, skipping insertion in model container [2024-11-09 01:52:27,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:52:27,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.i[916,929] [2024-11-09 01:52:27,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:52:27,255 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:52:27,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.i[916,929] [2024-11-09 01:52:27,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:52:27,342 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:52:27,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27 WrapperNode [2024-11-09 01:52:27,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:52:27,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:52:27,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:52:27,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:52:27,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,434 INFO L138 Inliner]: procedures = 29, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 526 [2024-11-09 01:52:27,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:52:27,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:52:27,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:52:27,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:52:27,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,489 INFO L175 MemorySlicer]: Split 131 memory accesses to 16 slices as follows [2, 17, 10, 10, 6, 12, 11, 5, 8, 5, 8, 6, 6, 6, 11, 8]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-11-09 01:52:27,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:52:27,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:52:27,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:52:27,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:52:27,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (1/1) ... [2024-11-09 01:52:27,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:52:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:52:27,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:52:27,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:52:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:52:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:52:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:52:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:52:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:52:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:52:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:52:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:52:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-09 01:52:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-09 01:52:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-09 01:52:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-09 01:52:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-09 01:52:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-09 01:52:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-09 01:52:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-09 01:52:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-09 01:52:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:52:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:52:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:52:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:52:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:52:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:52:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:52:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 01:52:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 01:52:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 01:52:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 01:52:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 01:52:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-09 01:52:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-09 01:52:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-09 01:52:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-09 01:52:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:52:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:52:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:52:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:52:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:52:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:52:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:52:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-09 01:52:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-09 01:52:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-09 01:52:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-09 01:52:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-09 01:52:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-09 01:52:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-09 01:52:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-09 01:52:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-09 01:52:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:52:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:52:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:52:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:52:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:52:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:52:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:52:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 01:52:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 01:52:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 01:52:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 01:52:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 01:52:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-09 01:52:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-09 01:52:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-09 01:52:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-09 01:52:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:52:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:52:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:52:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:52:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:52:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:52:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:52:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-09 01:52:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-09 01:52:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-09 01:52:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-09 01:52:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-09 01:52:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-09 01:52:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-09 01:52:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-09 01:52:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-09 01:52:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:52:27,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:52:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:52:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:52:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:52:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:52:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:52:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:52:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:52:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 01:52:27,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 01:52:27,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 01:52:27,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 01:52:27,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 01:52:27,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-09 01:52:27,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-09 01:52:27,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-09 01:52:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-09 01:52:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:52:27,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:52:27,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:52:27,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:52:28,297 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-09 01:52:28,297 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:52:28,309 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:52:28,310 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:52:28,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:28 BoogieIcfgContainer [2024-11-09 01:52:28,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:52:28,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:52:28,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:52:28,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:52:28,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:52:27" (1/3) ... [2024-11-09 01:52:28,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c3d8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:52:28, skipping insertion in model container [2024-11-09 01:52:28,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:27" (2/3) ... [2024-11-09 01:52:28,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c3d8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:52:28, skipping insertion in model container [2024-11-09 01:52:28,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:28" (3/3) ... [2024-11-09 01:52:28,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-44.i [2024-11-09 01:52:28,334 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:52:28,334 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:52:28,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:52:28,385 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;@54647c78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:52:28,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:52:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:52:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 01:52:28,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:28,400 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:28,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:28,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:28,405 INFO L85 PathProgramCache]: Analyzing trace with hash -532184568, now seen corresponding path program 1 times [2024-11-09 01:52:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:28,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037978174] [2024-11-09 01:52:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:28,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:28,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037978174] [2024-11-09 01:52:28,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037978174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:28,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:28,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:52:28,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769520672] [2024-11-09 01:52:28,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:28,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:52:28,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:52:28,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:52:28,880 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:52:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:28,914 INFO L93 Difference]: Finished difference Result 229 states and 359 transitions. [2024-11-09 01:52:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:52:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-11-09 01:52:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:28,924 INFO L225 Difference]: With dead ends: 229 [2024-11-09 01:52:28,925 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 01:52:28,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:52:28,931 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:28,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 01:52:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 01:52:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:52:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-11-09 01:52:28,981 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 159 [2024-11-09 01:52:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:28,983 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-11-09 01:52:28,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:52:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-11-09 01:52:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 01:52:28,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:28,986 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:28,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:52:28,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:28,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash 610843386, now seen corresponding path program 1 times [2024-11-09 01:52:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:28,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756277487] [2024-11-09 01:52:28,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:28,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:29,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:29,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756277487] [2024-11-09 01:52:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756277487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:29,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:52:29,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716415022] [2024-11-09 01:52:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:29,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:52:29,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:52:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:29,366 INFO L87 Difference]: Start difference. First operand 114 states and 165 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:29,403 INFO L93 Difference]: Finished difference Result 228 states and 331 transitions. [2024-11-09 01:52:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:52:29,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-09 01:52:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:29,440 INFO L225 Difference]: With dead ends: 228 [2024-11-09 01:52:29,441 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 01:52:29,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:29,444 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:29,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 477 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 01:52:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-09 01:52:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:52:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-09 01:52:29,455 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 159 [2024-11-09 01:52:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:29,456 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-09 01:52:29,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-09 01:52:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 01:52:29,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:29,462 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:29,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:52:29,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:29,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash 612690428, now seen corresponding path program 1 times [2024-11-09 01:52:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:29,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544315098] [2024-11-09 01:52:29,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:29,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:29,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544315098] [2024-11-09 01:52:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544315098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:29,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:29,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478622996] [2024-11-09 01:52:29,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:29,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:29,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:29,946 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:30,071 INFO L93 Difference]: Finished difference Result 283 states and 408 transitions. [2024-11-09 01:52:30,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:30,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-09 01:52:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:30,073 INFO L225 Difference]: With dead ends: 283 [2024-11-09 01:52:30,073 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 01:52:30,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:30,075 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 66 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:30,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 674 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 01:52:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 134. [2024-11-09 01:52:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 111 states have internal predecessors, (152), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:52:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 194 transitions. [2024-11-09 01:52:30,095 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 194 transitions. Word has length 159 [2024-11-09 01:52:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:30,096 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 194 transitions. [2024-11-09 01:52:30,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 194 transitions. [2024-11-09 01:52:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:52:30,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:30,100 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:30,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:52:30,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:30,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash 100791930, now seen corresponding path program 1 times [2024-11-09 01:52:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:30,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288593453] [2024-11-09 01:52:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288593453] [2024-11-09 01:52:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288593453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:30,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:30,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:52:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013617581] [2024-11-09 01:52:30,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:30,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:52:30,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:30,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:52:30,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:52:30,555 INFO L87 Difference]: Start difference. First operand 134 states and 194 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:30,684 INFO L93 Difference]: Finished difference Result 309 states and 443 transitions. [2024-11-09 01:52:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2024-11-09 01:52:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:30,686 INFO L225 Difference]: With dead ends: 309 [2024-11-09 01:52:30,686 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 01:52:30,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:30,692 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 74 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:30,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1030 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 01:52:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-11-09 01:52:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 150 states have internal predecessors, (203), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:52:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 249 transitions. [2024-11-09 01:52:30,709 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 249 transitions. Word has length 160 [2024-11-09 01:52:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:30,711 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 249 transitions. [2024-11-09 01:52:30,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 249 transitions. [2024-11-09 01:52:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 01:52:30,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:30,714 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:30,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:52:30,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:30,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash -142535225, now seen corresponding path program 1 times [2024-11-09 01:52:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:30,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752284410] [2024-11-09 01:52:30,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:30,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752284410] [2024-11-09 01:52:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752284410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418537604] [2024-11-09 01:52:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:30,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:30,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:30,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:30,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:30,971 INFO L87 Difference]: Start difference. First operand 175 states and 249 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:31,001 INFO L93 Difference]: Finished difference Result 353 states and 503 transitions. [2024-11-09 01:52:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:31,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-11-09 01:52:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:31,005 INFO L225 Difference]: With dead ends: 353 [2024-11-09 01:52:31,005 INFO L226 Difference]: Without dead ends: 181 [2024-11-09 01:52:31,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:31,008 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:31,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 631 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-09 01:52:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-09 01:52:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 156 states have internal predecessors, (209), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:52:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2024-11-09 01:52:31,025 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 161 [2024-11-09 01:52:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:31,025 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2024-11-09 01:52:31,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2024-11-09 01:52:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:52:31,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:31,027 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:31,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:52:31,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:31,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1915875796, now seen corresponding path program 1 times [2024-11-09 01:52:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353533060] [2024-11-09 01:52:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:31,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:31,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353533060] [2024-11-09 01:52:31,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353533060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:31,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:31,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:52:31,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561796125] [2024-11-09 01:52:31,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:31,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:52:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:31,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:52:31,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:52:31,338 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:31,429 INFO L93 Difference]: Finished difference Result 360 states and 503 transitions. [2024-11-09 01:52:31,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:31,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-11-09 01:52:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:31,431 INFO L225 Difference]: With dead ends: 360 [2024-11-09 01:52:31,431 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 01:52:31,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:31,432 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:31,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 720 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 01:52:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 141. [2024-11-09 01:52:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:52:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2024-11-09 01:52:31,439 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 163 [2024-11-09 01:52:31,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:31,440 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2024-11-09 01:52:31,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2024-11-09 01:52:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:52:31,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:31,441 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:31,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:52:31,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:31,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1067047084, now seen corresponding path program 1 times [2024-11-09 01:52:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:31,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274215282] [2024-11-09 01:52:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:31,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:31,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274215282] [2024-11-09 01:52:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274215282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:31,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:31,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:52:31,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818857660] [2024-11-09 01:52:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:52:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:31,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:52:31,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:52:31,585 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:31,595 INFO L93 Difference]: Finished difference Result 279 states and 393 transitions. [2024-11-09 01:52:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:52:31,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-11-09 01:52:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:31,596 INFO L225 Difference]: With dead ends: 279 [2024-11-09 01:52:31,596 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 01:52:31,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:52:31,597 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:31,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 01:52:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-09 01:52:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 117 states have internal predecessors, (155), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:52:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 197 transitions. [2024-11-09 01:52:31,603 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 197 transitions. Word has length 163 [2024-11-09 01:52:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:31,604 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 197 transitions. [2024-11-09 01:52:31,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 197 transitions. [2024-11-09 01:52:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-09 01:52:31,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:31,605 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:31,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:52:31,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:31,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash -46624942, now seen corresponding path program 1 times [2024-11-09 01:52:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:31,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268812563] [2024-11-09 01:52:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:31,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268812563] [2024-11-09 01:52:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268812563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:31,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:31,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:52:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881063014] [2024-11-09 01:52:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:31,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:52:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:52:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:52:31,922 INFO L87 Difference]: Start difference. First operand 141 states and 197 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:31,985 INFO L93 Difference]: Finished difference Result 355 states and 497 transitions. [2024-11-09 01:52:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:31,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2024-11-09 01:52:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:31,987 INFO L225 Difference]: With dead ends: 355 [2024-11-09 01:52:31,987 INFO L226 Difference]: Without dead ends: 217 [2024-11-09 01:52:31,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:31,988 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 64 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:31,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 760 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-09 01:52:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 161. [2024-11-09 01:52:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 137 states have internal predecessors, (185), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:52:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2024-11-09 01:52:31,994 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 164 [2024-11-09 01:52:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:31,994 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2024-11-09 01:52:31,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2024-11-09 01:52:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-09 01:52:31,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:31,995 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:31,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:52:31,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:31,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1057742192, now seen corresponding path program 1 times [2024-11-09 01:52:31,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:31,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199556428] [2024-11-09 01:52:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:31,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199556428] [2024-11-09 01:52:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199556428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:32,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:52:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589177541] [2024-11-09 01:52:32,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:32,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:52:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:52:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:32,438 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:32,472 INFO L93 Difference]: Finished difference Result 477 states and 675 transitions. [2024-11-09 01:52:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:52:32,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2024-11-09 01:52:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:32,474 INFO L225 Difference]: With dead ends: 477 [2024-11-09 01:52:32,474 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 01:52:32,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:32,475 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 100 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:32,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 472 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 01:52:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 299. [2024-11-09 01:52:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 252 states have (on average 1.3333333333333333) internal successors, (336), 252 states have internal predecessors, (336), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:52:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 420 transitions. [2024-11-09 01:52:32,487 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 420 transitions. Word has length 164 [2024-11-09 01:52:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:32,487 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 420 transitions. [2024-11-09 01:52:32,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 420 transitions. [2024-11-09 01:52:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 01:52:32,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:32,489 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:32,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:52:32,489 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:32,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1930074643, now seen corresponding path program 1 times [2024-11-09 01:52:32,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:32,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891341435] [2024-11-09 01:52:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:32,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:32,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891341435] [2024-11-09 01:52:32,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891341435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:32,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:32,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:52:32,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348156157] [2024-11-09 01:52:32,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:32,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:52:32,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:32,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:52:32,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:32,633 INFO L87 Difference]: Start difference. First operand 299 states and 420 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:32,670 INFO L93 Difference]: Finished difference Result 598 states and 840 transitions. [2024-11-09 01:52:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:52:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-09 01:52:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:32,673 INFO L225 Difference]: With dead ends: 598 [2024-11-09 01:52:32,673 INFO L226 Difference]: Without dead ends: 302 [2024-11-09 01:52:32,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:32,674 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:32,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 468 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-09 01:52:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2024-11-09 01:52:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 252 states have (on average 1.3095238095238095) internal successors, (330), 252 states have internal predecessors, (330), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:52:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 414 transitions. [2024-11-09 01:52:32,685 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 414 transitions. Word has length 165 [2024-11-09 01:52:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:32,686 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 414 transitions. [2024-11-09 01:52:32,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:32,686 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 414 transitions. [2024-11-09 01:52:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 01:52:32,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:32,687 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:32,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:52:32,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:32,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1492788230, now seen corresponding path program 1 times [2024-11-09 01:52:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:32,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069757709] [2024-11-09 01:52:32,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:33,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:33,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069757709] [2024-11-09 01:52:33,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069757709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:33,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:33,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:52:33,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303207019] [2024-11-09 01:52:33,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:33,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:52:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:33,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:52:33,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:33,253 INFO L87 Difference]: Start difference. First operand 299 states and 414 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:33,397 INFO L93 Difference]: Finished difference Result 779 states and 1068 transitions. [2024-11-09 01:52:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:52:33,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2024-11-09 01:52:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:33,400 INFO L225 Difference]: With dead ends: 779 [2024-11-09 01:52:33,400 INFO L226 Difference]: Without dead ends: 483 [2024-11-09 01:52:33,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:33,401 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 82 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:33,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1267 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-09 01:52:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 475. [2024-11-09 01:52:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 408 states have (on average 1.2990196078431373) internal successors, (530), 410 states have internal predecessors, (530), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 01:52:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 646 transitions. [2024-11-09 01:52:33,415 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 646 transitions. Word has length 166 [2024-11-09 01:52:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:33,415 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 646 transitions. [2024-11-09 01:52:33,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:33,415 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 646 transitions. [2024-11-09 01:52:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 01:52:33,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:33,417 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:33,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:52:33,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:33,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1633336840, now seen corresponding path program 1 times [2024-11-09 01:52:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208682536] [2024-11-09 01:52:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:34,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208682536] [2024-11-09 01:52:34,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208682536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:34,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:34,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:52:34,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617464640] [2024-11-09 01:52:34,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:34,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:52:34,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:34,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:52:34,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:52:34,175 INFO L87 Difference]: Start difference. First operand 475 states and 646 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:34,621 INFO L93 Difference]: Finished difference Result 1045 states and 1418 transitions. [2024-11-09 01:52:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:52:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2024-11-09 01:52:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:34,624 INFO L225 Difference]: With dead ends: 1045 [2024-11-09 01:52:34,624 INFO L226 Difference]: Without dead ends: 573 [2024-11-09 01:52:34,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:52:34,625 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 78 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:34,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1334 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:52:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-09 01:52:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 479. [2024-11-09 01:52:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 412 states have (on average 1.296116504854369) internal successors, (534), 414 states have internal predecessors, (534), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 01:52:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 650 transitions. [2024-11-09 01:52:34,641 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 650 transitions. Word has length 166 [2024-11-09 01:52:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:34,642 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 650 transitions. [2024-11-09 01:52:34,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 650 transitions. [2024-11-09 01:52:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 01:52:34,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:34,644 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:34,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:52:34,645 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:34,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1141040116, now seen corresponding path program 1 times [2024-11-09 01:52:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687450517] [2024-11-09 01:52:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:35,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:35,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687450517] [2024-11-09 01:52:35,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687450517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:35,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:35,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:52:35,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155074452] [2024-11-09 01:52:35,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:35,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:52:35,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:35,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:52:35,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:52:35,381 INFO L87 Difference]: Start difference. First operand 479 states and 650 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:35,799 INFO L93 Difference]: Finished difference Result 1069 states and 1444 transitions. [2024-11-09 01:52:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:52:35,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2024-11-09 01:52:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:35,802 INFO L225 Difference]: With dead ends: 1069 [2024-11-09 01:52:35,802 INFO L226 Difference]: Without dead ends: 593 [2024-11-09 01:52:35,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:52:35,803 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 92 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:35,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1492 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:52:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-09 01:52:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 479. [2024-11-09 01:52:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 412 states have (on average 1.296116504854369) internal successors, (534), 414 states have internal predecessors, (534), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 01:52:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 650 transitions. [2024-11-09 01:52:35,823 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 650 transitions. Word has length 166 [2024-11-09 01:52:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:35,823 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 650 transitions. [2024-11-09 01:52:35,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 650 transitions. [2024-11-09 01:52:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 01:52:35,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:35,825 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:35,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:52:35,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:35,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2142809930, now seen corresponding path program 1 times [2024-11-09 01:52:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533767388] [2024-11-09 01:52:35,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:35,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:36,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533767388] [2024-11-09 01:52:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533767388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459574744] [2024-11-09 01:52:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:36,012 INFO L87 Difference]: Start difference. First operand 479 states and 650 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:36,073 INFO L93 Difference]: Finished difference Result 1117 states and 1506 transitions. [2024-11-09 01:52:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:36,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2024-11-09 01:52:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:36,076 INFO L225 Difference]: With dead ends: 1117 [2024-11-09 01:52:36,076 INFO L226 Difference]: Without dead ends: 641 [2024-11-09 01:52:36,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:52:36,077 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 62 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:36,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 796 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-09 01:52:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 469. [2024-11-09 01:52:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 402 states have (on average 1.2835820895522387) internal successors, (516), 404 states have internal predecessors, (516), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 01:52:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 632 transitions. [2024-11-09 01:52:36,095 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 632 transitions. Word has length 166 [2024-11-09 01:52:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:36,096 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 632 transitions. [2024-11-09 01:52:36,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 632 transitions. [2024-11-09 01:52:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 01:52:36,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:36,097 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:36,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:52:36,097 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:36,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1718663864, now seen corresponding path program 1 times [2024-11-09 01:52:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:36,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085811475] [2024-11-09 01:52:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:36,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:36,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085811475] [2024-11-09 01:52:36,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085811475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:36,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:36,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:52:36,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827334283] [2024-11-09 01:52:36,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:36,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:52:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:36,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:52:36,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:52:36,765 INFO L87 Difference]: Start difference. First operand 469 states and 632 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:52:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:37,213 INFO L93 Difference]: Finished difference Result 1227 states and 1628 transitions. [2024-11-09 01:52:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 01:52:37,214 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 167 [2024-11-09 01:52:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:37,217 INFO L225 Difference]: With dead ends: 1227 [2024-11-09 01:52:37,218 INFO L226 Difference]: Without dead ends: 761 [2024-11-09 01:52:37,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:52:37,219 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 242 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:37,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1209 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:52:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-09 01:52:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 733. [2024-11-09 01:52:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 620 states have (on average 1.2451612903225806) internal successors, (772), 626 states have internal predecessors, (772), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 01:52:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 964 transitions. [2024-11-09 01:52:37,260 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 964 transitions. Word has length 167 [2024-11-09 01:52:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:37,260 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 964 transitions. [2024-11-09 01:52:37,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 01:52:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 964 transitions. [2024-11-09 01:52:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 01:52:37,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:37,262 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:37,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:52:37,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:37,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2028682844, now seen corresponding path program 1 times [2024-11-09 01:52:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:37,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641132386] [2024-11-09 01:52:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:37,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641132386] [2024-11-09 01:52:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641132386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:37,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:37,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830207634] [2024-11-09 01:52:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:37,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:37,475 INFO L87 Difference]: Start difference. First operand 733 states and 964 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:37,628 INFO L93 Difference]: Finished difference Result 1706 states and 2254 transitions. [2024-11-09 01:52:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:37,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2024-11-09 01:52:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:37,633 INFO L225 Difference]: With dead ends: 1706 [2024-11-09 01:52:37,633 INFO L226 Difference]: Without dead ends: 976 [2024-11-09 01:52:37,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:37,636 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 152 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:37,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 622 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:52:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-09 01:52:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 595. [2024-11-09 01:52:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 505 states have (on average 1.2455445544554455) internal successors, (629), 509 states have internal predecessors, (629), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-09 01:52:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 783 transitions. [2024-11-09 01:52:37,679 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 783 transitions. Word has length 167 [2024-11-09 01:52:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:37,680 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 783 transitions. [2024-11-09 01:52:37,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 783 transitions. [2024-11-09 01:52:37,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 01:52:37,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:37,683 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:37,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:52:37,683 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:37,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:37,683 INFO L85 PathProgramCache]: Analyzing trace with hash 887359690, now seen corresponding path program 1 times [2024-11-09 01:52:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:37,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212080455] [2024-11-09 01:52:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:52:37,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320896766] [2024-11-09 01:52:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:37,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:52:37,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:52:37,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:52:37,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:52:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:38,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 01:52:38,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:38,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:52:38,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:52:38,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 3 [2024-11-09 01:52:39,290 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 11 [2024-11-09 01:52:39,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:52:39,586 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 45 treesize of output 33 [2024-11-09 01:52:39,593 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 73 treesize of output 41 [2024-11-09 01:52:39,600 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 49 treesize of output 33 [2024-11-09 01:52:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 11 proven. 585 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-09 01:52:39,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:52:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:40,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:40,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212080455] [2024-11-09 01:52:40,952 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:52:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320896766] [2024-11-09 01:52:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320896766] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:52:40,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:52:40,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 23 [2024-11-09 01:52:40,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348436147] [2024-11-09 01:52:40,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:40,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:52:40,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:40,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:52:40,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-11-09 01:52:40,954 INFO L87 Difference]: Start difference. First operand 595 states and 783 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:42,033 INFO L93 Difference]: Finished difference Result 1183 states and 1554 transitions. [2024-11-09 01:52:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2024-11-09 01:52:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:42,038 INFO L225 Difference]: With dead ends: 1183 [2024-11-09 01:52:42,038 INFO L226 Difference]: Without dead ends: 591 [2024-11-09 01:52:42,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:52:42,039 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 110 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:42,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 697 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:52:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-09 01:52:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2024-11-09 01:52:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 497 states have (on average 1.2414486921529175) internal successors, (617), 501 states have internal predecessors, (617), 77 states have call successors, (77), 14 states have call predecessors, (77), 14 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-09 01:52:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 771 transitions. [2024-11-09 01:52:42,070 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 771 transitions. Word has length 167 [2024-11-09 01:52:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:42,070 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 771 transitions. [2024-11-09 01:52:42,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 771 transitions. [2024-11-09 01:52:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 01:52:42,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:42,072 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:42,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:52:42,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 01:52:42,273 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:42,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 635569450, now seen corresponding path program 1 times [2024-11-09 01:52:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211221898] [2024-11-09 01:52:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:52:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:52:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:52:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:52:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:52:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:52:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:52:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:52:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:52:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:52:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:52:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:52:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:52:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:52:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:52:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:52:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:52:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:52:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 01:52:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 01:52:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:52:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:42,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:52:42,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211221898] [2024-11-09 01:52:42,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211221898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:42,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:42,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:42,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844509836] [2024-11-09 01:52:42,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:42,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:52:42,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:42,507 INFO L87 Difference]: Start difference. First operand 589 states and 771 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:42,599 INFO L93 Difference]: Finished difference Result 1570 states and 2049 transitions. [2024-11-09 01:52:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:42,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2024-11-09 01:52:42,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:42,604 INFO L225 Difference]: With dead ends: 1570 [2024-11-09 01:52:42,604 INFO L226 Difference]: Without dead ends: 984 [2024-11-09 01:52:42,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:52:42,605 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 157 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:42,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 617 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-09 01:52:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 594. [2024-11-09 01:52:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 502 states have (on average 1.2390438247011952) internal successors, (622), 506 states have internal predecessors, (622), 77 states have call successors, (77), 14 states have call predecessors, (77), 14 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-09 01:52:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 776 transitions. [2024-11-09 01:52:42,641 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 776 transitions. Word has length 169 [2024-11-09 01:52:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:42,642 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 776 transitions. [2024-11-09 01:52:42,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 776 transitions. [2024-11-09 01:52:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 01:52:42,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:42,643 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:42,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:52:42,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:42,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1302150681, now seen corresponding path program 1 times [2024-11-09 01:52:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:52:42,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246873105] [2024-11-09 01:52:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:52:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:52:42,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551950770] [2024-11-09 01:52:42,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:42,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:52:42,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:52:42,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:52:42,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:52:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:52:43,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:52:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:52:43,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:52:43,586 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:52:43,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:52:43,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:52:43,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:52:43,800 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:43,972 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:52:43,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:52:43 BoogieIcfgContainer [2024-11-09 01:52:43,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:52:43,975 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:52:43,975 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:52:43,975 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:52:43,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:28" (3/4) ... [2024-11-09 01:52:43,978 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:52:43,979 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:52:43,980 INFO L158 Benchmark]: Toolchain (without parser) took 16961.99ms. Allocated memory was 180.4MB in the beginning and 639.6MB in the end (delta: 459.3MB). Free memory was 111.5MB in the beginning and 463.2MB in the end (delta: -351.7MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-11-09 01:52:43,980 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 180.4MB. Free memory was 140.8MB in the beginning and 140.6MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:52:43,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.34ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 152.3MB in the end (delta: -41.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-09 01:52:43,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.04ms. Allocated memory is still 180.4MB. Free memory was 152.3MB in the beginning and 148.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:52:43,981 INFO L158 Benchmark]: Boogie Preprocessor took 103.00ms. Allocated memory is still 180.4MB. Free memory was 148.6MB in the beginning and 142.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:52:43,981 INFO L158 Benchmark]: RCFGBuilder took 769.02ms. Allocated memory is still 180.4MB. Free memory was 142.3MB in the beginning and 95.3MB in the end (delta: 47.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-09 01:52:43,981 INFO L158 Benchmark]: TraceAbstraction took 15661.23ms. Allocated memory was 180.4MB in the beginning and 639.6MB in the end (delta: 459.3MB). Free memory was 94.0MB in the beginning and 464.3MB in the end (delta: -370.2MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2024-11-09 01:52:43,982 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 639.6MB. Free memory was 464.3MB in the beginning and 463.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:52:43,983 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.44ms. Allocated memory is still 180.4MB. Free memory was 140.8MB in the beginning and 140.6MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.34ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 152.3MB in the end (delta: -41.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.04ms. Allocated memory is still 180.4MB. Free memory was 152.3MB in the beginning and 148.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.00ms. Allocated memory is still 180.4MB. Free memory was 148.6MB in the beginning and 142.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 769.02ms. Allocated memory is still 180.4MB. Free memory was 142.3MB in the beginning and 95.3MB in the end (delta: 47.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15661.23ms. Allocated memory was 180.4MB in the beginning and 639.6MB in the end (delta: 459.3MB). Free memory was 94.0MB in the beginning and 464.3MB in the end (delta: -370.2MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 639.6MB. Free memory was 464.3MB in the beginning and 463.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someUnaryFLOAToperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L22] signed long int var_1_1 = 32; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] signed char var_1_3 = -25; [L24] signed char var_1_3 = -25; [L25] signed char* var_1_3_Pointer = &(var_1_3); [L26] signed char var_1_4 = -64; [L26] signed char var_1_4 = -64; [L27] signed char* var_1_4_Pointer = &(var_1_4); [L28] signed char var_1_5 = -1; [L28] signed char var_1_5 = -1; [L29] signed char* var_1_5_Pointer = &(var_1_5); [L30] signed char var_1_6 = 50; [L30] signed char var_1_6 = 50; [L31] signed char* var_1_6_Pointer = &(var_1_6); [L32] unsigned char var_1_7 = 1; [L32] unsigned char var_1_7 = 1; [L33] unsigned char* var_1_7_Pointer = &(var_1_7); [L34] unsigned char var_1_8 = 0; [L34] unsigned char var_1_8 = 0; [L35] unsigned char* var_1_8_Pointer = &(var_1_8); [L36] unsigned char var_1_10 = 0; [L36] unsigned char var_1_10 = 0; [L37] unsigned char* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_11 = 1; [L38] unsigned char var_1_11 = 1; [L39] unsigned char* var_1_11_Pointer = &(var_1_11); [L40] double var_1_12 = 10.5; [L40] double var_1_12 = 10.5; [L41] double* var_1_12_Pointer = &(var_1_12); [L42] unsigned char var_1_15 = 0; [L42] unsigned char var_1_15 = 0; [L43] unsigned char* var_1_15_Pointer = &(var_1_15); [L44] unsigned char var_1_16 = 0; [L44] unsigned char var_1_16 = 0; [L45] unsigned char* var_1_16_Pointer = &(var_1_16); [L46] unsigned char var_1_17 = 0; [L46] unsigned char var_1_17 = 0; [L47] unsigned char* var_1_17_Pointer = &(var_1_17); [L48] float var_1_18 = 50.75; [L48] float var_1_18 = 50.75; [L49] float* var_1_18_Pointer = &(var_1_18); [L50] float var_1_19 = 32.6; [L50] float var_1_19 = 32.6; [L51] float* var_1_19_Pointer = &(var_1_19); VAL [isInitial=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] FCALL updateLastVariables() [L125] CALL updateVariables() [L81] var_1_3 = __VERIFIER_nondet_char() [L82] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L84] var_1_4 = __VERIFIER_nondet_char() [L85] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L86] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L87] var_1_5 = __VERIFIER_nondet_char() [L88] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L89] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] var_1_6 = __VERIFIER_nondet_char() [L91] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L92] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] var_1_7 = __VERIFIER_nondet_uchar() [L94] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L95] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_7 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_7 <= 255) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L97] var_1_10 = __VERIFIER_nondet_uchar() [L98] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L100] var_1_12 = __VERIFIER_nondet_double() [L101] EXPR \read(var_1_12) [L101] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L101] EXPR \read(var_1_12) [L101] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] var_1_15 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L104] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L104] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L104] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] var_1_16 = __VERIFIER_nondet_uchar() [L106] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L107] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L107] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L107] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] var_1_17 = __VERIFIER_nondet_uchar() [L109] EXPR \read(var_1_17) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L109] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L109] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L110] EXPR \read(var_1_17) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L110] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L110] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L111] var_1_19 = __VERIFIER_nondet_float() [L112] EXPR \read(var_1_19) [L112] EXPR var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L112] EXPR var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F [L112] EXPR \read(var_1_19) [L112] EXPR var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L112] EXPR (var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L112] EXPR (var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L112] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L112] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L125] RET updateVariables() [L126] CALL step() [L55] EXPR \read(*var_1_4_Pointer) [L55] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L55] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L55] EXPR \read(*var_1_7_Pointer) [L55] signed long int stepLocal_1 = (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer)); [L56] EXPR \read(*var_1_5_Pointer) [L56] EXPR \read(*var_1_6_Pointer) [L56] signed long int stepLocal_0 = (*(var_1_5_Pointer)) - (*(var_1_6_Pointer)); [L57] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L57] COND FALSE !((*(var_1_4_Pointer)) > stepLocal_0) [L62] EXPR \read(*var_1_3_Pointer) [L62] (*(var_1_1_Pointer)) = (*(var_1_3_Pointer)) [L64] EXPR \read(*var_1_19_Pointer) [L64] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L65] EXPR (((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer))) [L65] EXPR \read(*var_1_18_Pointer) [L65] EXPR (((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer))) VAL [isInitial=1, stepLocal_1=37, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L65] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L65] COND FALSE !(((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) [L68] EXPR \read(*var_1_1_Pointer) [L68] signed long int stepLocal_3 = (*(var_1_1_Pointer)); [L69] EXPR \read(*var_1_1_Pointer) [L69] EXPR \read(*var_1_1_Pointer) [L69] EXPR \read(*var_1_6_Pointer) [L69] signed long int stepLocal_2 = (*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))); [L70] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L70] COND TRUE (*(var_1_11_Pointer)) [L71] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L71] COND FALSE !(stepLocal_3 > (*(var_1_1_Pointer))) [L74] EXPR \read(*var_1_1_Pointer) [L74] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] COND TRUE ((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < stepLocal_2 [L75] EXPR \read(*var_1_10_Pointer) [L75] (*(var_1_8_Pointer)) = (*(var_1_10_Pointer)) [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR \read(*var_1_4_Pointer) [L117] EXPR \read(*var_1_5_Pointer) [L117] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR ((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) [L117] EXPR \read(*var_1_1_Pointer) [L117] EXPR \read(*var_1_3_Pointer) [L117] EXPR ((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1) [L117] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1 [L117] EXPR \read(*var_1_1_Pointer) [L117] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR ((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1) [L117] EXPR \read(*var_1_1_Pointer) [L117] EXPR \read(*var_1_7_Pointer) [L117] EXPR \read(*var_1_1_Pointer) [L117] EXPR \read(*var_1_1_Pointer) [L117] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1 [L117] EXPR \read(*var_1_8_Pointer) [L117] EXPR \read(*var_1_10_Pointer) [L117] EXPR (((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR ((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR ((((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1)) && ((((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((((*(var_1_6_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_15_Pointer))) || ((*(var_1_16_Pointer)) || (*(var_1_17_Pointer)))))) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR ((((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1)) && ((((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((((*(var_1_6_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_15_Pointer))) || ((*(var_1_16_Pointer)) || (*(var_1_17_Pointer)))))) : 1) [L117] EXPR \read(*var_1_12_Pointer) [L117] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer))) [L117] EXPR \read(*var_1_18_Pointer) [L117] EXPR (((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((((*(var_1_6_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_15_Pointer))) || ((*(var_1_16_Pointer)) || (*(var_1_17_Pointer)))))) : 1 [L117] EXPR (((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((((*(var_1_6_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_15_Pointer))) || ((*(var_1_16_Pointer)) || (*(var_1_17_Pointer)))))) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR ((((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1)) && ((((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((((*(var_1_6_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_15_Pointer))) || ((*(var_1_16_Pointer)) || (*(var_1_17_Pointer)))))) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (((((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1)) && ((((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((((*(var_1_6_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_15_Pointer))) || ((*(var_1_16_Pointer)) || (*(var_1_17_Pointer)))))) : 1)) && ((*(var_1_18_Pointer)) == ((float) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117] EXPR (((((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1)) && ((((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((((*(var_1_6_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_15_Pointer))) || ((*(var_1_16_Pointer)) || (*(var_1_17_Pointer)))))) : 1)) && ((*(var_1_18_Pointer)) == ((float) (*(var_1_19_Pointer)))) [L117] EXPR \read(*var_1_18_Pointer) [L117] EXPR \read(*var_1_19_Pointer) [L117] EXPR (((((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1)) && ((((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((((*(var_1_6_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_15_Pointer))) || ((*(var_1_16_Pointer)) || (*(var_1_17_Pointer)))))) : 1)) && ((*(var_1_18_Pointer)) == ((float) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L117-L118] return (((((*(var_1_4_Pointer)) > ((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) ? ((((((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) / (*(var_1_7_Pointer))) <= (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer))))) && ((*(var_1_11_Pointer)) ? (((*(var_1_1_Pointer)) > (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((((*(var_1_1_Pointer)) % (*(var_1_7_Pointer))) < ((*(var_1_1_Pointer)) * ((*(var_1_1_Pointer)) * (*(var_1_6_Pointer))))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) : 1)) : 1)) && ((((*(var_1_12_Pointer)) - (((((*(var_1_18_Pointer))) < 0 ) ? -((*(var_1_18_Pointer))) : ((*(var_1_18_Pointer)))))) >= (*(var_1_18_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((((*(var_1_6_Pointer)) < (*(var_1_1_Pointer))) && (*(var_1_15_Pointer))) || ((*(var_1_16_Pointer)) || (*(var_1_17_Pointer)))))) : 1)) && ((*(var_1_18_Pointer)) == ((float) (*(var_1_19_Pointer)))) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1350 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1350 mSDsluCounter, 13753 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10447 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1508 IncrementalHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 3306 mSDtfsCounter, 1508 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1202 GetRequests, 1085 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=733occurred in iteration=15, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1349 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 3460 NumberOfCodeBlocks, 3460 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3099 ConstructedInterpolants, 0 QuantifiedInterpolants, 11741 SizeOfPredicates, 21 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 15375/15960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:52:44,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.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 0f58e05e69aba02ac6d50b38841a74177f33dc95d4d7184ac65f3b02be95b15d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:52:46,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:52:46,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:52:46,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:52:46,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:52:46,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:52:46,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:52:46,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:52:46,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:52:46,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:52:46,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:52:46,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:52:46,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:52:46,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:52:46,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:52:46,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:52:46,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:52:46,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:52:46,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:52:46,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:52:46,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:52:46,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:52:46,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:52:46,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:52:46,116 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:52:46,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:52:46,117 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:52:46,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:52:46,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:52:46,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:52:46,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:52:46,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:52:46,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:52:46,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:52:46,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:52:46,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:52:46,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:52:46,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:52:46,119 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:52:46,119 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:52:46,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:52:46,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:52:46,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:52:46,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:52:46,122 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 -> 0f58e05e69aba02ac6d50b38841a74177f33dc95d4d7184ac65f3b02be95b15d [2024-11-09 01:52:46,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:52:46,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:52:46,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:52:46,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:52:46,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:52:46,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.i [2024-11-09 01:52:47,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:52:48,022 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:52:48,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.i [2024-11-09 01:52:48,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689fd3da2/d34a223cbc4149bd84df1821acabeded/FLAG1f020f3b8 [2024-11-09 01:52:48,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689fd3da2/d34a223cbc4149bd84df1821acabeded [2024-11-09 01:52:48,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:52:48,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:52:48,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:52:48,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:52:48,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:52:48,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f10e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48, skipping insertion in model container [2024-11-09 01:52:48,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:52:48,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.i[916,929] [2024-11-09 01:52:48,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:52:48,305 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:52:48,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-44.i[916,929] [2024-11-09 01:52:48,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:52:48,372 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:52:48,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48 WrapperNode [2024-11-09 01:52:48,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:52:48,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:52:48,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:52:48,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:52:48,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,437 INFO L138 Inliner]: procedures = 36, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2024-11-09 01:52:48,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:52:48,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:52:48,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:52:48,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:52:48,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,497 INFO L175 MemorySlicer]: Split 131 memory accesses to 16 slices as follows [2, 17, 10, 10, 6, 12, 11, 5, 8, 5, 8, 6, 6, 6, 11, 8]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-11-09 01:52:48,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:52:48,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:52:48,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:52:48,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:52:48,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (1/1) ... [2024-11-09 01:52:48,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:52:48,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:52:48,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:52:48,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:52:48,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:52:48,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:52:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:52:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:52:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:52:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:52:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-09 01:52:48,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-09 01:52:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-09 01:52:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-09 01:52:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-09 01:52:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-09 01:52:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-09 01:52:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-09 01:52:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-09 01:52:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-09 01:52:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-09 01:52:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:52:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:52:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-09 01:52:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-09 01:52:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-09 01:52:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-09 01:52:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-09 01:52:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-09 01:52:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-09 01:52:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-09 01:52:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-09 01:52:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:52:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:52:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:52:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:52:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:52:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:52:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:52:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-09 01:52:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-09 01:52:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-09 01:52:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-09 01:52:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-09 01:52:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-09 01:52:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-09 01:52:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-09 01:52:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-09 01:52:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:52:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:52:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:52:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:52:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:52:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:52:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:52:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-09 01:52:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-09 01:52:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-09 01:52:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-09 01:52:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-09 01:52:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-09 01:52:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-09 01:52:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-09 01:52:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-11-09 01:52:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-09 01:52:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-09 01:52:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-09 01:52:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-09 01:52:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-09 01:52:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-09 01:52:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-09 01:52:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-09 01:52:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-11-09 01:52:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:52:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:52:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:52:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:52:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:52:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:52:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-09 01:52:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-09 01:52:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-09 01:52:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-09 01:52:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-09 01:52:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-09 01:52:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-09 01:52:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-09 01:52:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-11-09 01:52:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-11-09 01:52:48,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:52:48,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:52:48,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:52:48,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:52:48,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:52:48,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:52:48,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-09 01:52:48,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-09 01:52:48,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-09 01:52:48,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-09 01:52:48,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-09 01:52:48,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-09 01:52:48,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-09 01:52:48,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-09 01:52:48,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:52:48,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:52:48,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-09 01:52:48,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-09 01:52:48,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-09 01:52:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-09 01:52:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-09 01:52:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-09 01:52:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-09 01:52:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-09 01:52:48,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-11-09 01:52:48,916 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:52:48,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:52:51,768 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-09 01:52:51,769 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:52:51,783 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:52:51,783 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:52:51,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:51 BoogieIcfgContainer [2024-11-09 01:52:51,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:52:51,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:52:51,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:52:51,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:52:51,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:52:48" (1/3) ... [2024-11-09 01:52:51,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e3862e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:52:51, skipping insertion in model container [2024-11-09 01:52:51,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:52:48" (2/3) ... [2024-11-09 01:52:51,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e3862e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:52:51, skipping insertion in model container [2024-11-09 01:52:51,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:52:51" (3/3) ... [2024-11-09 01:52:51,789 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-44.i [2024-11-09 01:52:51,800 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:52:51,801 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:52:51,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:52:51,858 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;@79cb4678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:52:51,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:52:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:52:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 01:52:51,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:51,873 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:51,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:51,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash -532184568, now seen corresponding path program 1 times [2024-11-09 01:52:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:52:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266319290] [2024-11-09 01:52:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:51,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:51,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:52:51,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:52:51,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:52:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:52,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:52:52,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-09 01:52:52,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:52:52,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:52:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266319290] [2024-11-09 01:52:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266319290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:52,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:52:52,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103887286] [2024-11-09 01:52:52,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:52,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:52:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:52:52,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:52:52,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:52:52,401 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:52:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:52,427 INFO L93 Difference]: Finished difference Result 229 states and 359 transitions. [2024-11-09 01:52:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:52:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-11-09 01:52:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:52,434 INFO L225 Difference]: With dead ends: 229 [2024-11-09 01:52:52,434 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 01:52:52,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:52:52,439 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:52,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 01:52:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 01:52:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:52:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-11-09 01:52:52,472 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 159 [2024-11-09 01:52:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:52,473 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-11-09 01:52:52,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:52:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-11-09 01:52:52,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 01:52:52,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:52,475 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:52,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:52:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:52,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:52,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash 610843386, now seen corresponding path program 1 times [2024-11-09 01:52:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:52:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470589951] [2024-11-09 01:52:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:52,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:52:52,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:52:52,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:52:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:53,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:52:53,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:53,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 17 treesize of output 9 [2024-11-09 01:52:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:53,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:52:53,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:52:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470589951] [2024-11-09 01:52:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470589951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:53,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:53,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:52:53,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001719548] [2024-11-09 01:52:53,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:53,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:52:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:52:53,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:52:53,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:52:53,605 INFO L87 Difference]: Start difference. First operand 114 states and 165 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:54,069 INFO L93 Difference]: Finished difference Result 336 states and 489 transitions. [2024-11-09 01:52:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:52:54,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-09 01:52:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:54,086 INFO L225 Difference]: With dead ends: 336 [2024-11-09 01:52:54,086 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 01:52:54,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:54,088 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 78 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:54,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 475 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:52:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 01:52:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 217. [2024-11-09 01:52:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.3488372093023255) internal successors, (232), 172 states have internal predecessors, (232), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:52:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 316 transitions. [2024-11-09 01:52:54,119 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 316 transitions. Word has length 159 [2024-11-09 01:52:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:54,119 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 316 transitions. [2024-11-09 01:52:54,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 316 transitions. [2024-11-09 01:52:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:52:54,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:54,121 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:54,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:52:54,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:54,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:54,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1677508115, now seen corresponding path program 1 times [2024-11-09 01:52:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:52:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587539055] [2024-11-09 01:52:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:54,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:52:54,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:52:54,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:52:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:54,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:52:54,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:54,784 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 17 treesize of output 13 [2024-11-09 01:52:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:54,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:52:54,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:52:54,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587539055] [2024-11-09 01:52:54,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587539055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:54,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:54,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:52:54,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099965634] [2024-11-09 01:52:54,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:54,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:52:54,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:52:54,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:52:54,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:52:54,850 INFO L87 Difference]: Start difference. First operand 217 states and 316 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:57,212 INFO L93 Difference]: Finished difference Result 527 states and 768 transitions. [2024-11-09 01:52:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:52:57,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2024-11-09 01:52:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:57,215 INFO L225 Difference]: With dead ends: 527 [2024-11-09 01:52:57,215 INFO L226 Difference]: Without dead ends: 313 [2024-11-09 01:52:57,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:52:57,217 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 268 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:57,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 617 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 01:52:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-09 01:52:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 247. [2024-11-09 01:52:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 202 states have (on average 1.3663366336633664) internal successors, (276), 202 states have internal predecessors, (276), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:52:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 360 transitions. [2024-11-09 01:52:57,238 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 360 transitions. Word has length 160 [2024-11-09 01:52:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:57,239 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 360 transitions. [2024-11-09 01:52:57,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 360 transitions. [2024-11-09 01:52:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 01:52:57,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:57,241 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:57,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 01:52:57,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:57,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:57,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1306443435, now seen corresponding path program 1 times [2024-11-09 01:52:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:52:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422217609] [2024-11-09 01:52:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:57,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:57,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:52:57,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:52:57,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:52:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:57,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:52:57,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:52:57,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:52:57,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:52:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422217609] [2024-11-09 01:52:57,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422217609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:52:57,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:52:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:52:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670780282] [2024-11-09 01:52:57,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:52:57,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:52:57,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:52:57,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:52:57,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:57,833 INFO L87 Difference]: Start difference. First operand 247 states and 360 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:52:57,895 INFO L93 Difference]: Finished difference Result 501 states and 731 transitions. [2024-11-09 01:52:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:52:57,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-11-09 01:52:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:52:57,899 INFO L225 Difference]: With dead ends: 501 [2024-11-09 01:52:57,899 INFO L226 Difference]: Without dead ends: 257 [2024-11-09 01:52:57,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:52:57,900 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:52:57,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 627 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:52:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-09 01:52:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-11-09 01:52:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 210 states have (on average 1.3523809523809525) internal successors, (284), 210 states have internal predecessors, (284), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:52:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 368 transitions. [2024-11-09 01:52:57,914 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 368 transitions. Word has length 161 [2024-11-09 01:52:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:52:57,915 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 368 transitions. [2024-11-09 01:52:57,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:52:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 368 transitions. [2024-11-09 01:52:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 01:52:57,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:52:57,917 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:52:57,932 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:52:58,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:58,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:52:58,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:52:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1304596393, now seen corresponding path program 1 times [2024-11-09 01:52:58,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:52:58,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394199317] [2024-11-09 01:52:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:52:58,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:52:58,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:52:58,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:52:58,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:52:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:52:58,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:52:58,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:52:59,441 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 25 [2024-11-09 01:52:59,449 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 29 treesize of output 21 [2024-11-09 01:52:59,455 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 25 treesize of output 17 [2024-11-09 01:53:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-09 01:53:00,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:53:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:53:01,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:01,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394199317] [2024-11-09 01:53:01,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394199317] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:53:01,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:53:01,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2024-11-09 01:53:01,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872918168] [2024-11-09 01:53:01,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:01,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:53:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:01,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:53:01,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:53:01,768 INFO L87 Difference]: Start difference. First operand 255 states and 368 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:04,109 INFO L93 Difference]: Finished difference Result 597 states and 852 transitions. [2024-11-09 01:53:04,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:53:04,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-11-09 01:53:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:04,113 INFO L225 Difference]: With dead ends: 597 [2024-11-09 01:53:04,113 INFO L226 Difference]: Without dead ends: 345 [2024-11-09 01:53:04,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:53:04,114 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 73 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:04,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 747 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 01:53:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-09 01:53:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2024-11-09 01:53:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 290 states have (on average 1.3448275862068966) internal successors, (390), 292 states have internal predecessors, (390), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 01:53:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 482 transitions. [2024-11-09 01:53:04,146 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 482 transitions. Word has length 161 [2024-11-09 01:53:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:04,146 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 482 transitions. [2024-11-09 01:53:04,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 482 transitions. [2024-11-09 01:53:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 01:53:04,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:04,150 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:04,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:53:04,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:04,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:04,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1574914400, now seen corresponding path program 1 times [2024-11-09 01:53:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:04,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699610651] [2024-11-09 01:53:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:04,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:04,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:04,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:53:04,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 01:53:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:04,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:53:04,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:05,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:53:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:53:05,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:53:05,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699610651] [2024-11-09 01:53:05,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699610651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:53:05,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:53:05,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:53:05,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404837199] [2024-11-09 01:53:05,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:05,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:53:05,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:05,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:53:05,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:53:05,093 INFO L87 Difference]: Start difference. First operand 341 states and 482 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:06,110 INFO L93 Difference]: Finished difference Result 693 states and 980 transitions. [2024-11-09 01:53:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:53:06,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 162 [2024-11-09 01:53:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:06,125 INFO L225 Difference]: With dead ends: 693 [2024-11-09 01:53:06,129 INFO L226 Difference]: Without dead ends: 355 [2024-11-09 01:53:06,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:53:06,130 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 71 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:06,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 474 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:53:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-09 01:53:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 341. [2024-11-09 01:53:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 290 states have (on average 1.3379310344827586) internal successors, (388), 292 states have internal predecessors, (388), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 01:53:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 480 transitions. [2024-11-09 01:53:06,151 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 480 transitions. Word has length 162 [2024-11-09 01:53:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:06,152 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 480 transitions. [2024-11-09 01:53:06,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 480 transitions. [2024-11-09 01:53:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-09 01:53:06,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:06,155 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:06,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 01:53:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:06,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash -210976659, now seen corresponding path program 1 times [2024-11-09 01:53:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:06,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049131507] [2024-11-09 01:53:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:06,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:06,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:06,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:53:06,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 01:53:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:06,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:53:06,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:06,766 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 13 [2024-11-09 01:53:06,769 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 13 treesize of output 9 [2024-11-09 01:53:06,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 01:53:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:53:06,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:53:06,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:06,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049131507] [2024-11-09 01:53:06,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049131507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:53:06,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:53:06,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:53:06,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932947306] [2024-11-09 01:53:06,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:06,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:53:06,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:06,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:53:06,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:53:06,860 INFO L87 Difference]: Start difference. First operand 341 states and 480 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:08,837 INFO L93 Difference]: Finished difference Result 911 states and 1283 transitions. [2024-11-09 01:53:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:53:08,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2024-11-09 01:53:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:08,851 INFO L225 Difference]: With dead ends: 911 [2024-11-09 01:53:08,851 INFO L226 Difference]: Without dead ends: 573 [2024-11-09 01:53:08,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:53:08,854 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 156 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:08,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 619 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 01:53:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-09 01:53:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 569. [2024-11-09 01:53:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 472 states have (on average 1.319915254237288) internal successors, (623), 474 states have internal predecessors, (623), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-09 01:53:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 799 transitions. [2024-11-09 01:53:08,900 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 799 transitions. Word has length 164 [2024-11-09 01:53:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:08,900 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 799 transitions. [2024-11-09 01:53:08,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 799 transitions. [2024-11-09 01:53:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 01:53:08,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:08,902 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:08,915 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 (8)] Forceful destruction successful, exit code 0 [2024-11-09 01:53:09,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:09,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:09,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:09,103 INFO L85 PathProgramCache]: Analyzing trace with hash -918957393, now seen corresponding path program 1 times [2024-11-09 01:53:09,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:09,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215367732] [2024-11-09 01:53:09,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:09,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:09,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:09,106 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:53:09,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 01:53:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:09,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:53:09,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:09,725 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 17 treesize of output 13 [2024-11-09 01:53:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-09 01:53:09,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:53:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:53:09,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:09,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215367732] [2024-11-09 01:53:09,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215367732] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:53:09,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:53:09,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-11-09 01:53:09,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572940997] [2024-11-09 01:53:09,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:09,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:53:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:09,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:53:09,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:53:09,907 INFO L87 Difference]: Start difference. First operand 569 states and 799 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:12,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:53:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:13,684 INFO L93 Difference]: Finished difference Result 1297 states and 1813 transitions. [2024-11-09 01:53:13,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:53:13,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-09 01:53:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:13,693 INFO L225 Difference]: With dead ends: 1297 [2024-11-09 01:53:13,693 INFO L226 Difference]: Without dead ends: 731 [2024-11-09 01:53:13,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:53:13,695 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 85 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:13,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1083 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 01:53:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-09 01:53:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 723. [2024-11-09 01:53:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 606 states have (on average 1.3102310231023102) internal successors, (794), 610 states have internal predecessors, (794), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 100 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-09 01:53:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1002 transitions. [2024-11-09 01:53:13,779 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1002 transitions. Word has length 165 [2024-11-09 01:53:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:13,783 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1002 transitions. [2024-11-09 01:53:13,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1002 transitions. [2024-11-09 01:53:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 01:53:13,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:13,785 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:13,801 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-11-09 01:53:13,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:13,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:13,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1318495542, now seen corresponding path program 1 times [2024-11-09 01:53:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:13,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977166919] [2024-11-09 01:53:13,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:13,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:13,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:13,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:53:13,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 01:53:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:14,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:53:14,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:14,576 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 25 treesize of output 17 [2024-11-09 01:53:14,582 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 21 treesize of output 13 [2024-11-09 01:53:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:53:14,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:53:14,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:14,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977166919] [2024-11-09 01:53:14,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977166919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:53:14,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:53:14,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:53:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506240121] [2024-11-09 01:53:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:14,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:53:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:53:14,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:53:14,994 INFO L87 Difference]: Start difference. First operand 723 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:17,002 INFO L93 Difference]: Finished difference Result 1863 states and 2580 transitions. [2024-11-09 01:53:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:53:17,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-09 01:53:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:17,008 INFO L225 Difference]: With dead ends: 1863 [2024-11-09 01:53:17,008 INFO L226 Difference]: Without dead ends: 1143 [2024-11-09 01:53:17,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:53:17,012 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 299 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:17,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 524 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 01:53:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-11-09 01:53:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 847. [2024-11-09 01:53:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 730 states have (on average 1.3315068493150686) internal successors, (972), 734 states have internal predecessors, (972), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 100 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-09 01:53:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1180 transitions. [2024-11-09 01:53:17,051 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1180 transitions. Word has length 165 [2024-11-09 01:53:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:17,053 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1180 transitions. [2024-11-09 01:53:17,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1180 transitions. [2024-11-09 01:53:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 01:53:17,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:17,056 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:17,071 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-11-09 01:53:17,260 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-11-09 01:53:17,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:17,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1965354504, now seen corresponding path program 1 times [2024-11-09 01:53:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:17,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859228862] [2024-11-09 01:53:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:17,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:17,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:17,265 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-11-09 01:53:17,266 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-11-09 01:53:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:17,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:53:17,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:18,900 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 34 treesize of output 26 [2024-11-09 01:53:18,906 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 30 treesize of output 22 [2024-11-09 01:53:18,911 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 26 treesize of output 18 [2024-11-09 01:53:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-09 01:53:20,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:53:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:53:20,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859228862] [2024-11-09 01:53:20,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859228862] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:53:20,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:53:20,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2024-11-09 01:53:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567435950] [2024-11-09 01:53:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:20,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:53:20,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:20,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:53:20,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:53:20,789 INFO L87 Difference]: Start difference. First operand 847 states and 1180 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:23,366 INFO L93 Difference]: Finished difference Result 1683 states and 2340 transitions. [2024-11-09 01:53:23,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:53:23,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-09 01:53:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:23,384 INFO L225 Difference]: With dead ends: 1683 [2024-11-09 01:53:23,384 INFO L226 Difference]: Without dead ends: 839 [2024-11-09 01:53:23,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:53:23,386 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 126 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:23,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 452 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 01:53:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-11-09 01:53:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 735. [2024-11-09 01:53:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 622 states have (on average 1.3231511254019293) internal successors, (823), 624 states have internal predecessors, (823), 100 states have call successors, (100), 12 states have call predecessors, (100), 12 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-09 01:53:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1023 transitions. [2024-11-09 01:53:23,415 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1023 transitions. Word has length 165 [2024-11-09 01:53:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:23,416 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1023 transitions. [2024-11-09 01:53:23,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1023 transitions. [2024-11-09 01:53:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 01:53:23,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:23,417 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:23,433 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 (11)] Ended with exit code 0 [2024-11-09 01:53:23,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:23,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:23,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2127643042, now seen corresponding path program 1 times [2024-11-09 01:53:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:23,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677722563] [2024-11-09 01:53:23,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:23,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:23,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:23,625 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:53:23,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 01:53:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:24,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:53:24,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:24,062 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 17 treesize of output 13 [2024-11-09 01:53:24,104 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 13 treesize of output 9 [2024-11-09 01:53:24,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 01:53:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:53:24,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:53:24,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:24,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677722563] [2024-11-09 01:53:24,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677722563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:53:24,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:53:24,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:53:24,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846748207] [2024-11-09 01:53:24,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:24,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:53:24,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:24,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:53:24,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:53:24,152 INFO L87 Difference]: Start difference. First operand 735 states and 1023 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:25,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:53:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:27,849 INFO L93 Difference]: Finished difference Result 1531 states and 2126 transitions. [2024-11-09 01:53:27,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:53:27,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-09 01:53:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:27,853 INFO L225 Difference]: With dead ends: 1531 [2024-11-09 01:53:27,853 INFO L226 Difference]: Without dead ends: 799 [2024-11-09 01:53:27,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:53:27,855 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 494 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:27,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 553 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 01:53:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-09 01:53:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 735. [2024-11-09 01:53:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 622 states have (on average 1.319935691318328) internal successors, (821), 624 states have internal predecessors, (821), 100 states have call successors, (100), 12 states have call predecessors, (100), 12 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-09 01:53:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1021 transitions. [2024-11-09 01:53:27,881 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1021 transitions. Word has length 165 [2024-11-09 01:53:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:27,882 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1021 transitions. [2024-11-09 01:53:27,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1021 transitions. [2024-11-09 01:53:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 01:53:27,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:27,883 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:27,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 01:53:28,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:28,084 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:28,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash 86787359, now seen corresponding path program 1 times [2024-11-09 01:53:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81567087] [2024-11-09 01:53:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:28,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:28,087 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:53:28,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 01:53:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:28,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:53:28,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:29,167 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-11-09 01:53:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 5 proven. 375 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-09 01:53:29,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:53:29,413 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-09 01:53:29,413 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-11-09 01:53:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-09 01:53:29,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:29,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81567087] [2024-11-09 01:53:29,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81567087] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:53:29,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:53:29,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2024-11-09 01:53:29,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182097855] [2024-11-09 01:53:29,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:53:29,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:53:29,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:29,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:53:29,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:53:29,643 INFO L87 Difference]: Start difference. First operand 735 states and 1021 transitions. Second operand has 12 states, 10 states have (on average 7.6) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-09 01:53:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:31,156 INFO L93 Difference]: Finished difference Result 1159 states and 1599 transitions. [2024-11-09 01:53:31,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:53:31,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.6) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) Word has length 165 [2024-11-09 01:53:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:31,160 INFO L225 Difference]: With dead ends: 1159 [2024-11-09 01:53:31,161 INFO L226 Difference]: Without dead ends: 771 [2024-11-09 01:53:31,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-09 01:53:31,162 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 396 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:31,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 734 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 01:53:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-09 01:53:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 751. [2024-11-09 01:53:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 634 states have (on average 1.3028391167192428) internal successors, (826), 636 states have internal predecessors, (826), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-09 01:53:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1026 transitions. [2024-11-09 01:53:31,206 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1026 transitions. Word has length 165 [2024-11-09 01:53:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:31,206 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1026 transitions. [2024-11-09 01:53:31,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.6) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-09 01:53:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1026 transitions. [2024-11-09 01:53:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 01:53:31,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:31,207 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:31,222 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 (13)] Ended with exit code 0 [2024-11-09 01:53:31,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:31,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:31,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1633336840, now seen corresponding path program 1 times [2024-11-09 01:53:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:31,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087988100] [2024-11-09 01:53:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:31,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:31,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:31,414 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:53:31,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 01:53:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:31,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 01:53:31,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:53:33,836 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 34 treesize of output 26 [2024-11-09 01:53:34,193 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 29 treesize of output 21 [2024-11-09 01:53:34,197 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 34 treesize of output 22 [2024-11-09 01:53:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 1 proven. 467 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-09 01:53:35,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:53:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:53:38,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:53:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087988100] [2024-11-09 01:53:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087988100] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:53:38,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:53:38,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 22 [2024-11-09 01:53:38,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858614915] [2024-11-09 01:53:38,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:53:38,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:53:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:53:38,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:53:38,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:53:38,774 INFO L87 Difference]: Start difference. First operand 751 states and 1026 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:40,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:53:42,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:53:46,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:53:48,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:53:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:53:49,630 INFO L93 Difference]: Finished difference Result 1657 states and 2259 transitions. [2024-11-09 01:53:49,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:53:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2024-11-09 01:53:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:53:49,639 INFO L225 Difference]: With dead ends: 1657 [2024-11-09 01:53:49,640 INFO L226 Difference]: Without dead ends: 909 [2024-11-09 01:53:49,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:53:49,642 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 235 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:53:49,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1022 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-09 01:53:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-09 01:53:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 759. [2024-11-09 01:53:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 642 states have (on average 1.2990654205607477) internal successors, (834), 644 states have internal predecessors, (834), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-09 01:53:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1034 transitions. [2024-11-09 01:53:49,722 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1034 transitions. Word has length 166 [2024-11-09 01:53:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:53:49,722 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1034 transitions. [2024-11-09 01:53:49,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 01:53:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1034 transitions. [2024-11-09 01:53:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 01:53:49,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:53:49,724 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:53:49,755 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 (14)] Ended with exit code 0 [2024-11-09 01:53:49,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:49,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:53:49,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:53:49,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1141040116, now seen corresponding path program 1 times [2024-11-09 01:53:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:53:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61654113] [2024-11-09 01:53:49,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:53:49,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:53:49,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:53:49,929 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:53:49,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 01:53:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:53:50,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:53:50,710 INFO L278 TraceCheckSpWp]: Computing forward predicates...