./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.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 e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:42:19,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:42:19,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:42:19,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:42:19,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:42:19,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:42:19,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:42:19,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:42:19,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:42:19,546 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:42:19,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:42:19,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:42:19,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:42:19,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:42:19,548 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:42:19,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:42:19,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:42:19,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:42:19,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:42:19,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:42:19,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:42:19,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:42:19,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:42:19,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:42:19,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:42:19,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:42:19,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:42:19,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:42:19,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:42:19,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:42:19,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:42:19,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:42:19,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:19,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:42:19,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:42:19,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:42:19,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:42:19,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:42:19,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:42:19,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:42:19,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:42:19,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:42:19,558 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 -> e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 [2024-10-24 11:42:19,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:42:19,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:42:19,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:42:19,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:42:19,830 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:42:19,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2024-10-24 11:42:21,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:42:21,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:42:21,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2024-10-24 11:42:21,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dfa8c2f/6118716087ed46e5ae52e7c93c0ca68b/FLAG89588eadc [2024-10-24 11:42:21,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dfa8c2f/6118716087ed46e5ae52e7c93c0ca68b [2024-10-24 11:42:21,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:42:21,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:42:21,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:21,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:42:21,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:42:21,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:21" (1/1) ... [2024-10-24 11:42:21,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2875b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:21, skipping insertion in model container [2024-10-24 11:42:21,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:21" (1/1) ... [2024-10-24 11:42:21,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:42:22,114 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2024-10-24 11:42:22,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:22,211 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:42:22,230 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2024-10-24 11:42:22,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:22,294 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:42:22,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22 WrapperNode [2024-10-24 11:42:22,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:22,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:22,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:42:22,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:42:22,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,356 INFO L138 Inliner]: procedures = 29, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2024-10-24 11:42:22,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:22,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:42:22,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:42:22,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:42:22,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,426 INFO L175 MemorySlicer]: Split 122 memory accesses to 16 slices as follows [2, 7, 10, 14, 16, 8, 4, 6, 8, 4, 8, 9, 6, 9, 3, 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, 1, 1, 1, 1, 1, 1, 2, 1, 1]. [2024-10-24 11:42:22,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:42:22,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:42:22,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:42:22,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:42:22,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (1/1) ... [2024-10-24 11:42:22,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:22,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:22,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:42:22,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:42:22,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:42:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:42:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:42:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:42:22,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:42:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:42:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:42:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-24 11:42:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-24 11:42:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-24 11:42:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-24 11:42:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-24 11:42:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-24 11:42:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-24 11:42:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-24 11:42:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-24 11:42:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-24 11:42:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:42:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:42:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:42:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:42:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:42:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:42:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:42:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 11:42:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 11:42:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 11:42:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 11:42:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-24 11:42:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-24 11:42:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-24 11:42:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-24 11:42:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-24 11:42:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:42:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:42:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:42:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:42:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:42:22,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:42:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-24 11:42:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-24 11:42:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-24 11:42:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:42:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-24 11:42:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-24 11:42:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-24 11:42:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-24 11:42:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:42:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:42:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:42:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:42:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:42:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:42:22,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-24 11:42:22,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-24 11:42:22,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-24 11:42:22,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-24 11:42:22,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-24 11:42:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-24 11:42:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-24 11:42:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-24 11:42:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-24 11:42:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-24 11:42:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:42:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:42:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:42:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:42:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:42:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:42:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:42:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:42:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:42:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 11:42:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 11:42:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 11:42:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 11:42:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-24 11:42:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-24 11:42:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-24 11:42:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-24 11:42:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-24 11:42:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:42:22,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:42:22,809 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:42:22,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:42:23,342 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-24 11:42:23,342 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:42:23,401 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:42:23,402 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:42:23,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:23 BoogieIcfgContainer [2024-10-24 11:42:23,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:42:23,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:42:23,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:42:23,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:42:23,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:42:21" (1/3) ... [2024-10-24 11:42:23,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1b717c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:42:23, skipping insertion in model container [2024-10-24 11:42:23,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:22" (2/3) ... [2024-10-24 11:42:23,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1b717c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:42:23, skipping insertion in model container [2024-10-24 11:42:23,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:23" (3/3) ... [2024-10-24 11:42:23,411 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-84.i [2024-10-24 11:42:23,427 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:42:23,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:42:23,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:42:23,511 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;@4e1e9f9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:42:23,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:42:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:42:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 11:42:23,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:23,529 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:23,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:23,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1918731661, now seen corresponding path program 1 times [2024-10-24 11:42:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763185582] [2024-10-24 11:42:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:24,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763185582] [2024-10-24 11:42:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763185582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:24,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:24,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:42:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352106988] [2024-10-24 11:42:24,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:24,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:42:24,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:42:24,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:42:24,071 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 11:42:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:24,131 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-24 11:42:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:42:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-24 11:42:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:24,142 INFO L225 Difference]: With dead ends: 189 [2024-10-24 11:42:24,142 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 11:42:24,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:42:24,149 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:24,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 11:42:24,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 11:42:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:42:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-24 11:42:24,199 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 145 [2024-10-24 11:42:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:24,199 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-24 11:42:24,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 11:42:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-24 11:42:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 11:42:24,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:24,203 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:24,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:42:24,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:24,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1521079025, now seen corresponding path program 1 times [2024-10-24 11:42:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:24,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656596560] [2024-10-24 11:42:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656596560] [2024-10-24 11:42:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656596560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:42:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884379263] [2024-10-24 11:42:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:24,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:42:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:42:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:42:24,654 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:24,721 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-10-24 11:42:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:42:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-24 11:42:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:24,726 INFO L225 Difference]: With dead ends: 190 [2024-10-24 11:42:24,728 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 11:42:24,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:42:24,730 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:24,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 11:42:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-24 11:42:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:42:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-24 11:42:24,753 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 145 [2024-10-24 11:42:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:24,757 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-24 11:42:24,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-24 11:42:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 11:42:24,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:24,761 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:24,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:42:24,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:24,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1521138607, now seen corresponding path program 1 times [2024-10-24 11:42:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:24,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648670834] [2024-10-24 11:42:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:25,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648670834] [2024-10-24 11:42:25,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648670834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:25,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:25,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:42:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828251710] [2024-10-24 11:42:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:25,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:25,216 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:25,470 INFO L93 Difference]: Finished difference Result 312 states and 447 transitions. [2024-10-24 11:42:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:25,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-24 11:42:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:25,482 INFO L225 Difference]: With dead ends: 312 [2024-10-24 11:42:25,485 INFO L226 Difference]: Without dead ends: 217 [2024-10-24 11:42:25,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:42:25,489 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 202 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:25,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 461 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-24 11:42:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 191. [2024-10-24 11:42:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 148 states have (on average 1.3108108108108107) internal successors, (194), 148 states have internal predecessors, (194), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:42:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 274 transitions. [2024-10-24 11:42:25,537 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 274 transitions. Word has length 145 [2024-10-24 11:42:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:25,538 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 274 transitions. [2024-10-24 11:42:25,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 274 transitions. [2024-10-24 11:42:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 11:42:25,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:25,544 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:25,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:42:25,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:25,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:25,545 INFO L85 PathProgramCache]: Analyzing trace with hash 191378129, now seen corresponding path program 1 times [2024-10-24 11:42:25,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:25,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097657727] [2024-10-24 11:42:25,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:25,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:27,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097657727] [2024-10-24 11:42:27,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097657727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:27,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:27,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:42:27,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97618605] [2024-10-24 11:42:27,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:27,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:42:27,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:27,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:42:27,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:42:27,106 INFO L87 Difference]: Start difference. First operand 191 states and 274 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:27,657 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2024-10-24 11:42:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:42:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-10-24 11:42:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:27,664 INFO L225 Difference]: With dead ends: 599 [2024-10-24 11:42:27,664 INFO L226 Difference]: Without dead ends: 409 [2024-10-24 11:42:27,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:42:27,667 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 165 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:27,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1357 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:42:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-24 11:42:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 221. [2024-10-24 11:42:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 178 states have internal predecessors, (235), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:42:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2024-10-24 11:42:27,712 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 153 [2024-10-24 11:42:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:27,713 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2024-10-24 11:42:27,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2024-10-24 11:42:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 11:42:27,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:27,716 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:27,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:42:27,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:27,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash -626270321, now seen corresponding path program 1 times [2024-10-24 11:42:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:27,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540047116] [2024-10-24 11:42:27,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540047116] [2024-10-24 11:42:28,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540047116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:28,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:28,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:42:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968815129] [2024-10-24 11:42:28,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:28,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:42:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:28,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:42:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:42:28,747 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:29,016 INFO L93 Difference]: Finished difference Result 517 states and 735 transitions. [2024-10-24 11:42:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:42:29,017 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-10-24 11:42:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:29,020 INFO L225 Difference]: With dead ends: 517 [2024-10-24 11:42:29,020 INFO L226 Difference]: Without dead ends: 297 [2024-10-24 11:42:29,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:42:29,022 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 59 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:29,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 975 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-24 11:42:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 225. [2024-10-24 11:42:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.3241758241758241) internal successors, (241), 182 states have internal predecessors, (241), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:42:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 321 transitions. [2024-10-24 11:42:29,045 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 321 transitions. Word has length 153 [2024-10-24 11:42:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:29,047 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 321 transitions. [2024-10-24 11:42:29,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 321 transitions. [2024-10-24 11:42:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:29,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:29,050 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:29,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:42:29,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:29,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1107459412, now seen corresponding path program 1 times [2024-10-24 11:42:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:29,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791777665] [2024-10-24 11:42:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:29,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:29,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791777665] [2024-10-24 11:42:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791777665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:29,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:42:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233085413] [2024-10-24 11:42:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:29,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:42:29,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:29,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:42:29,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:42:29,888 INFO L87 Difference]: Start difference. First operand 225 states and 321 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:30,382 INFO L93 Difference]: Finished difference Result 557 states and 789 transitions. [2024-10-24 11:42:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:42:30,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2024-10-24 11:42:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:30,385 INFO L225 Difference]: With dead ends: 557 [2024-10-24 11:42:30,386 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 11:42:30,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:42:30,388 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 329 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:30,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 763 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:42:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 11:42:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2024-10-24 11:42:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 282 states have internal predecessors, (376), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:42:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 464 transitions. [2024-10-24 11:42:30,425 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 464 transitions. Word has length 155 [2024-10-24 11:42:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:30,426 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 464 transitions. [2024-10-24 11:42:30,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 464 transitions. [2024-10-24 11:42:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:30,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:30,430 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:30,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:42:30,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1907644206, now seen corresponding path program 1 times [2024-10-24 11:42:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:30,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160646192] [2024-10-24 11:42:30,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:30,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160646192] [2024-10-24 11:42:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160646192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:31,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:31,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:42:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389433571] [2024-10-24 11:42:31,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:31,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:42:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:31,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:42:31,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:42:31,210 INFO L87 Difference]: Start difference. First operand 329 states and 464 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:31,811 INFO L93 Difference]: Finished difference Result 677 states and 948 transitions. [2024-10-24 11:42:31,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:42:31,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2024-10-24 11:42:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:31,815 INFO L225 Difference]: With dead ends: 677 [2024-10-24 11:42:31,815 INFO L226 Difference]: Without dead ends: 349 [2024-10-24 11:42:31,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:42:31,820 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 280 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:31,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 866 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:42:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-24 11:42:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 341. [2024-10-24 11:42:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 286 states have (on average 1.3286713286713288) internal successors, (380), 288 states have internal predecessors, (380), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:42:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 476 transitions. [2024-10-24 11:42:31,851 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 476 transitions. Word has length 155 [2024-10-24 11:42:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:31,851 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 476 transitions. [2024-10-24 11:42:31,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 476 transitions. [2024-10-24 11:42:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:31,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:31,854 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:31,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:42:31,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:31,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:31,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1353532792, now seen corresponding path program 1 times [2024-10-24 11:42:31,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:31,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413709304] [2024-10-24 11:42:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413709304] [2024-10-24 11:42:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413709304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:32,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:32,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:42:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906497077] [2024-10-24 11:42:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:32,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:32,089 INFO L87 Difference]: Start difference. First operand 341 states and 476 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:32,143 INFO L93 Difference]: Finished difference Result 693 states and 967 transitions. [2024-10-24 11:42:32,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:32,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:42:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:32,168 INFO L225 Difference]: With dead ends: 693 [2024-10-24 11:42:32,168 INFO L226 Difference]: Without dead ends: 353 [2024-10-24 11:42:32,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:32,169 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:32,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:32,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-24 11:42:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2024-10-24 11:42:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 298 states have (on average 1.3154362416107384) internal successors, (392), 300 states have internal predecessors, (392), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:42:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 488 transitions. [2024-10-24 11:42:32,200 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 488 transitions. Word has length 155 [2024-10-24 11:42:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:32,203 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 488 transitions. [2024-10-24 11:42:32,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 488 transitions. [2024-10-24 11:42:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:32,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:32,205 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:32,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:42:32,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:32,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash 652468214, now seen corresponding path program 1 times [2024-10-24 11:42:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:32,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363211452] [2024-10-24 11:42:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:32,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363211452] [2024-10-24 11:42:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363211452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:32,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:32,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:42:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973071412] [2024-10-24 11:42:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:32,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:42:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:42:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:42:32,825 INFO L87 Difference]: Start difference. First operand 353 states and 488 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:32,979 INFO L93 Difference]: Finished difference Result 953 states and 1307 transitions. [2024-10-24 11:42:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:42:32,980 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:42:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:32,986 INFO L225 Difference]: With dead ends: 953 [2024-10-24 11:42:32,986 INFO L226 Difference]: Without dead ends: 601 [2024-10-24 11:42:32,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:42:32,988 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 54 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:32,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 637 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-10-24 11:42:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 513. [2024-10-24 11:42:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 448 states have (on average 1.3370535714285714) internal successors, (599), 452 states have internal predecessors, (599), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 11:42:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 711 transitions. [2024-10-24 11:42:33,030 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 711 transitions. Word has length 155 [2024-10-24 11:42:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:33,031 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 711 transitions. [2024-10-24 11:42:33,031 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 711 transitions. [2024-10-24 11:42:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:33,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:33,033 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:33,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:42:33,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:33,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:33,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1333670196, now seen corresponding path program 1 times [2024-10-24 11:42:33,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:33,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139585575] [2024-10-24 11:42:33,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:33,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:33,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:33,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139585575] [2024-10-24 11:42:33,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139585575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:33,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:33,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:42:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832406149] [2024-10-24 11:42:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:33,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:42:33,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:42:33,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:42:33,480 INFO L87 Difference]: Start difference. First operand 513 states and 711 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:33,671 INFO L93 Difference]: Finished difference Result 1239 states and 1706 transitions. [2024-10-24 11:42:33,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:42:33,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:42:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:33,676 INFO L225 Difference]: With dead ends: 1239 [2024-10-24 11:42:33,677 INFO L226 Difference]: Without dead ends: 727 [2024-10-24 11:42:33,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:42:33,679 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 56 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:33,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 727 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-24 11:42:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 721. [2024-10-24 11:42:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 644 states have (on average 1.3338509316770186) internal successors, (859), 652 states have internal predecessors, (859), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 56 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 11:42:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 987 transitions. [2024-10-24 11:42:33,733 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 987 transitions. Word has length 155 [2024-10-24 11:42:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:33,734 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 987 transitions. [2024-10-24 11:42:33,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 987 transitions. [2024-10-24 11:42:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:33,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:33,738 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:33,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:42:33,738 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:33,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1372949198, now seen corresponding path program 1 times [2024-10-24 11:42:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:33,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433540094] [2024-10-24 11:42:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:34,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:34,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433540094] [2024-10-24 11:42:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433540094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:42:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583880544] [2024-10-24 11:42:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:34,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:42:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:42:34,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:42:34,450 INFO L87 Difference]: Start difference. First operand 721 states and 987 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:34,912 INFO L93 Difference]: Finished difference Result 1430 states and 1951 transitions. [2024-10-24 11:42:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:42:34,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2024-10-24 11:42:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:34,917 INFO L225 Difference]: With dead ends: 1430 [2024-10-24 11:42:34,917 INFO L226 Difference]: Without dead ends: 710 [2024-10-24 11:42:34,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:42:34,920 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 231 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:34,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 426 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:42:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-24 11:42:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 695. [2024-10-24 11:42:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 618 states have (on average 1.3171521035598706) internal successors, (814), 626 states have internal predecessors, (814), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 56 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 11:42:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 942 transitions. [2024-10-24 11:42:35,007 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 942 transitions. Word has length 155 [2024-10-24 11:42:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:35,007 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 942 transitions. [2024-10-24 11:42:35,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 942 transitions. [2024-10-24 11:42:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:35,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:35,010 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:35,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:42:35,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:35,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:35,011 INFO L85 PathProgramCache]: Analyzing trace with hash 518454708, now seen corresponding path program 1 times [2024-10-24 11:42:35,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:35,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532851784] [2024-10-24 11:42:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:35,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532851784] [2024-10-24 11:42:35,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532851784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:35,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:35,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:42:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724795430] [2024-10-24 11:42:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:35,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:35,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:35,289 INFO L87 Difference]: Start difference. First operand 695 states and 942 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:35,461 INFO L93 Difference]: Finished difference Result 1481 states and 1997 transitions. [2024-10-24 11:42:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:35,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:42:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:35,469 INFO L225 Difference]: With dead ends: 1481 [2024-10-24 11:42:35,469 INFO L226 Difference]: Without dead ends: 787 [2024-10-24 11:42:35,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:42:35,472 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 64 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:35,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 702 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-24 11:42:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 783. [2024-10-24 11:42:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 684 states have (on average 1.2967836257309941) internal successors, (887), 694 states have internal predecessors, (887), 80 states have call successors, (80), 18 states have call predecessors, (80), 18 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 11:42:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1047 transitions. [2024-10-24 11:42:35,554 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1047 transitions. Word has length 155 [2024-10-24 11:42:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:35,555 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1047 transitions. [2024-10-24 11:42:35,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1047 transitions. [2024-10-24 11:42:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:35,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:35,558 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:35,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:42:35,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:35,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash 278743982, now seen corresponding path program 1 times [2024-10-24 11:42:35,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:35,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700535980] [2024-10-24 11:42:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:36,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700535980] [2024-10-24 11:42:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700535980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:36,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:42:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288875037] [2024-10-24 11:42:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:36,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:42:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:42:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:42:36,333 INFO L87 Difference]: Start difference. First operand 783 states and 1047 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:36,968 INFO L93 Difference]: Finished difference Result 1872 states and 2497 transitions. [2024-10-24 11:42:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:42:36,969 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2024-10-24 11:42:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:36,975 INFO L225 Difference]: With dead ends: 1872 [2024-10-24 11:42:36,975 INFO L226 Difference]: Without dead ends: 1090 [2024-10-24 11:42:36,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:42:36,979 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 405 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:36,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 829 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:42:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2024-10-24 11:42:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 711. [2024-10-24 11:42:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 622 states have (on average 1.3006430868167203) internal successors, (809), 629 states have internal predecessors, (809), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 953 transitions. [2024-10-24 11:42:37,037 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 953 transitions. Word has length 155 [2024-10-24 11:42:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:37,037 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 953 transitions. [2024-10-24 11:42:37,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 953 transitions. [2024-10-24 11:42:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:37,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:37,039 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:37,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:42:37,040 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:37,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1001119696, now seen corresponding path program 1 times [2024-10-24 11:42:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469308499] [2024-10-24 11:42:37,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:37,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469308499] [2024-10-24 11:42:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469308499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:37,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:42:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432248438] [2024-10-24 11:42:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:37,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:42:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:37,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:42:37,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:42:37,711 INFO L87 Difference]: Start difference. First operand 711 states and 953 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:38,209 INFO L93 Difference]: Finished difference Result 1595 states and 2124 transitions. [2024-10-24 11:42:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:42:38,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2024-10-24 11:42:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:38,215 INFO L225 Difference]: With dead ends: 1595 [2024-10-24 11:42:38,215 INFO L226 Difference]: Without dead ends: 885 [2024-10-24 11:42:38,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:42:38,217 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 176 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:38,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 792 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:42:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-24 11:42:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 703. [2024-10-24 11:42:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 614 states have (on average 1.298045602605863) internal successors, (797), 621 states have internal predecessors, (797), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 941 transitions. [2024-10-24 11:42:38,279 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 941 transitions. Word has length 155 [2024-10-24 11:42:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:38,280 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 941 transitions. [2024-10-24 11:42:38,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 941 transitions. [2024-10-24 11:42:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:38,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:38,283 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:38,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:42:38,283 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:38,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1535814704, now seen corresponding path program 1 times [2024-10-24 11:42:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255709136] [2024-10-24 11:42:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:38,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:38,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:38,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255709136] [2024-10-24 11:42:38,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255709136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:38,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:38,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:42:38,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534517537] [2024-10-24 11:42:38,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:38,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:42:38,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:38,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:42:38,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:42:38,856 INFO L87 Difference]: Start difference. First operand 703 states and 941 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:39,167 INFO L93 Difference]: Finished difference Result 1659 states and 2202 transitions. [2024-10-24 11:42:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:42:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:42:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:39,172 INFO L225 Difference]: With dead ends: 1659 [2024-10-24 11:42:39,172 INFO L226 Difference]: Without dead ends: 957 [2024-10-24 11:42:39,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:42:39,175 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 56 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:39,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 824 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2024-10-24 11:42:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 715. [2024-10-24 11:42:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 626 states have (on average 1.2875399361022364) internal successors, (806), 633 states have internal predecessors, (806), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 950 transitions. [2024-10-24 11:42:39,233 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 950 transitions. Word has length 155 [2024-10-24 11:42:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:39,233 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 950 transitions. [2024-10-24 11:42:39,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 950 transitions. [2024-10-24 11:42:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:42:39,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:39,236 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:39,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:42:39,236 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:39,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1748035342, now seen corresponding path program 1 times [2024-10-24 11:42:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:39,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374677762] [2024-10-24 11:42:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:39,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374677762] [2024-10-24 11:42:39,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374677762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:39,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:39,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:42:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715361602] [2024-10-24 11:42:39,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:39,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:42:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:39,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:42:39,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:42:39,758 INFO L87 Difference]: Start difference. First operand 715 states and 950 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:40,277 INFO L93 Difference]: Finished difference Result 1582 states and 2087 transitions. [2024-10-24 11:42:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:42:40,277 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2024-10-24 11:42:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:40,282 INFO L225 Difference]: With dead ends: 1582 [2024-10-24 11:42:40,282 INFO L226 Difference]: Without dead ends: 868 [2024-10-24 11:42:40,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:42:40,284 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 265 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:40,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 914 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:42:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-24 11:42:40,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 709. [2024-10-24 11:42:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 620 states have (on average 1.2806451612903227) internal successors, (794), 627 states have internal predecessors, (794), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 938 transitions. [2024-10-24 11:42:40,347 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 938 transitions. Word has length 155 [2024-10-24 11:42:40,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:40,347 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 938 transitions. [2024-10-24 11:42:40,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 938 transitions. [2024-10-24 11:42:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 11:42:40,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:40,349 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:40,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:42:40,350 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:40,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash 318936039, now seen corresponding path program 1 times [2024-10-24 11:42:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:40,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178895268] [2024-10-24 11:42:40,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:40,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:41,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:41,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178895268] [2024-10-24 11:42:41,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178895268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:41,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:41,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:42:41,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765574948] [2024-10-24 11:42:41,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:41,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:42:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:41,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:42:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:42:41,116 INFO L87 Difference]: Start difference. First operand 709 states and 938 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:41,468 INFO L93 Difference]: Finished difference Result 1651 states and 2182 transitions. [2024-10-24 11:42:41,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:42:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-24 11:42:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:41,473 INFO L225 Difference]: With dead ends: 1651 [2024-10-24 11:42:41,473 INFO L226 Difference]: Without dead ends: 943 [2024-10-24 11:42:41,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:42:41,476 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 57 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:41,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1094 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-10-24 11:42:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 769. [2024-10-24 11:42:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 680 states have (on average 1.285294117647059) internal successors, (874), 687 states have internal predecessors, (874), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1018 transitions. [2024-10-24 11:42:41,581 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1018 transitions. Word has length 157 [2024-10-24 11:42:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:41,582 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1018 transitions. [2024-10-24 11:42:41,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1018 transitions. [2024-10-24 11:42:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 11:42:41,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:41,585 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:41,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:42:41,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:41,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:41,586 INFO L85 PathProgramCache]: Analyzing trace with hash -692181211, now seen corresponding path program 1 times [2024-10-24 11:42:41,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:41,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933740441] [2024-10-24 11:42:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:42,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933740441] [2024-10-24 11:42:42,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933740441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:42,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:42,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:42:42,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959372659] [2024-10-24 11:42:42,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:42,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:42:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:42,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:42:42,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:42:42,659 INFO L87 Difference]: Start difference. First operand 769 states and 1018 transitions. Second operand has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-24 11:42:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:43,572 INFO L93 Difference]: Finished difference Result 1687 states and 2222 transitions. [2024-10-24 11:42:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:42:43,573 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 157 [2024-10-24 11:42:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:43,577 INFO L225 Difference]: With dead ends: 1687 [2024-10-24 11:42:43,578 INFO L226 Difference]: Without dead ends: 919 [2024-10-24 11:42:43,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:42:43,580 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 424 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:43,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 831 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:42:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-10-24 11:42:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 769. [2024-10-24 11:42:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 680 states have (on average 1.2735294117647058) internal successors, (866), 687 states have internal predecessors, (866), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1010 transitions. [2024-10-24 11:42:43,640 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1010 transitions. Word has length 157 [2024-10-24 11:42:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:43,640 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1010 transitions. [2024-10-24 11:42:43,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-24 11:42:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1010 transitions. [2024-10-24 11:42:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 11:42:43,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:43,642 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:43,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:42:43,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash -190537051, now seen corresponding path program 1 times [2024-10-24 11:42:43,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:43,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219214745] [2024-10-24 11:42:43,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:43,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:44,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:44,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219214745] [2024-10-24 11:42:44,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219214745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:44,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:44,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:42:44,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886180531] [2024-10-24 11:42:44,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:44,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:42:44,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:44,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:42:44,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:42:44,170 INFO L87 Difference]: Start difference. First operand 769 states and 1010 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:44,498 INFO L93 Difference]: Finished difference Result 1481 states and 1947 transitions. [2024-10-24 11:42:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:42:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2024-10-24 11:42:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:44,502 INFO L225 Difference]: With dead ends: 1481 [2024-10-24 11:42:44,503 INFO L226 Difference]: Without dead ends: 713 [2024-10-24 11:42:44,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:42:44,505 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 130 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:44,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 395 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-24 11:42:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2024-10-24 11:42:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 624 states have (on average 1.2692307692307692) internal successors, (792), 631 states have internal predecessors, (792), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 936 transitions. [2024-10-24 11:42:44,564 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 936 transitions. Word has length 157 [2024-10-24 11:42:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:44,565 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 936 transitions. [2024-10-24 11:42:44,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 936 transitions. [2024-10-24 11:42:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 11:42:44,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:44,567 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:44,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:42:44,567 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:44,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1445623194, now seen corresponding path program 1 times [2024-10-24 11:42:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868796731] [2024-10-24 11:42:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:44,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868796731] [2024-10-24 11:42:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868796731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:44,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:44,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:42:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317079952] [2024-10-24 11:42:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:44,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:44,781 INFO L87 Difference]: Start difference. First operand 713 states and 936 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:44,868 INFO L93 Difference]: Finished difference Result 1452 states and 1907 transitions. [2024-10-24 11:42:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:44,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-24 11:42:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:44,873 INFO L225 Difference]: With dead ends: 1452 [2024-10-24 11:42:44,873 INFO L226 Difference]: Without dead ends: 740 [2024-10-24 11:42:44,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:44,876 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:44,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-10-24 11:42:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2024-10-24 11:42:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 651 states have (on average 1.2580645161290323) internal successors, (819), 658 states have internal predecessors, (819), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 963 transitions. [2024-10-24 11:42:44,952 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 963 transitions. Word has length 157 [2024-10-24 11:42:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:44,952 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 963 transitions. [2024-10-24 11:42:44,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 963 transitions. [2024-10-24 11:42:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 11:42:44,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:44,954 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:44,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:42:44,955 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:44,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1578929239, now seen corresponding path program 1 times [2024-10-24 11:42:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:44,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776949803] [2024-10-24 11:42:44,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:45,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:45,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776949803] [2024-10-24 11:42:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776949803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:45,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:45,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:42:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341705984] [2024-10-24 11:42:45,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:45,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:42:45,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:45,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:42:45,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:42:45,412 INFO L87 Difference]: Start difference. First operand 740 states and 963 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:45,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:45,797 INFO L93 Difference]: Finished difference Result 1627 states and 2106 transitions. [2024-10-24 11:42:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:42:45,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2024-10-24 11:42:45,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:45,802 INFO L225 Difference]: With dead ends: 1627 [2024-10-24 11:42:45,802 INFO L226 Difference]: Without dead ends: 888 [2024-10-24 11:42:45,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:42:45,804 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 201 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:45,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 533 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:42:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-10-24 11:42:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 740. [2024-10-24 11:42:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 651 states have (on average 1.2549923195084485) internal successors, (817), 658 states have internal predecessors, (817), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 961 transitions. [2024-10-24 11:42:45,865 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 961 transitions. Word has length 157 [2024-10-24 11:42:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:45,866 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 961 transitions. [2024-10-24 11:42:45,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 11:42:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 961 transitions. [2024-10-24 11:42:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 11:42:45,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:45,868 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:45,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:42:45,868 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:45,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:45,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2088402329, now seen corresponding path program 1 times [2024-10-24 11:42:45,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:45,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36671217] [2024-10-24 11:42:45,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36671217] [2024-10-24 11:42:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36671217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:46,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:46,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:42:46,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162816623] [2024-10-24 11:42:46,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:46,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:42:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:42:46,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:42:46,840 INFO L87 Difference]: Start difference. First operand 740 states and 961 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:47,614 INFO L93 Difference]: Finished difference Result 1881 states and 2430 transitions. [2024-10-24 11:42:47,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:42:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-24 11:42:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:47,620 INFO L225 Difference]: With dead ends: 1881 [2024-10-24 11:42:47,621 INFO L226 Difference]: Without dead ends: 1142 [2024-10-24 11:42:47,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:42:47,624 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 147 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:47,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1610 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:42:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-10-24 11:42:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 772. [2024-10-24 11:42:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 683 states have (on average 1.2518301610541727) internal successors, (855), 690 states have internal predecessors, (855), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 999 transitions. [2024-10-24 11:42:47,689 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 999 transitions. Word has length 157 [2024-10-24 11:42:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:47,690 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 999 transitions. [2024-10-24 11:42:47,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 999 transitions. [2024-10-24 11:42:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 11:42:47,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:47,691 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:47,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:42:47,692 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:47,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1869547611, now seen corresponding path program 1 times [2024-10-24 11:42:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849593945] [2024-10-24 11:42:47,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:48,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:48,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849593945] [2024-10-24 11:42:48,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849593945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:48,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:48,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:42:48,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937838117] [2024-10-24 11:42:48,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:48,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:42:48,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:48,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:42:48,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:42:48,360 INFO L87 Difference]: Start difference. First operand 772 states and 999 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:48,742 INFO L93 Difference]: Finished difference Result 1661 states and 2144 transitions. [2024-10-24 11:42:48,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:42:48,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-24 11:42:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:48,747 INFO L225 Difference]: With dead ends: 1661 [2024-10-24 11:42:48,747 INFO L226 Difference]: Without dead ends: 890 [2024-10-24 11:42:48,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:42:48,750 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 50 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:48,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1447 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:42:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-24 11:42:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 724. [2024-10-24 11:42:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 635 states have (on average 1.2551181102362206) internal successors, (797), 642 states have internal predecessors, (797), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 941 transitions. [2024-10-24 11:42:48,806 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 941 transitions. Word has length 157 [2024-10-24 11:42:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:48,806 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 941 transitions. [2024-10-24 11:42:48,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 941 transitions. [2024-10-24 11:42:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-24 11:42:48,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:48,808 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:48,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 11:42:48,809 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:48,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 693435245, now seen corresponding path program 1 times [2024-10-24 11:42:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:48,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489273830] [2024-10-24 11:42:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:42:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:42:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:42:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:49,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:42:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:42:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:49,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:42:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:49,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:42:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:42:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:42:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:49,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:42:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:49,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489273830] [2024-10-24 11:42:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489273830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:49,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:49,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:42:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343942301] [2024-10-24 11:42:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:49,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:49,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:49,016 INFO L87 Difference]: Start difference. First operand 724 states and 941 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:49,128 INFO L93 Difference]: Finished difference Result 1459 states and 1890 transitions. [2024-10-24 11:42:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:49,129 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2024-10-24 11:42:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:49,133 INFO L225 Difference]: With dead ends: 1459 [2024-10-24 11:42:49,133 INFO L226 Difference]: Without dead ends: 736 [2024-10-24 11:42:49,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:42:49,135 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 485 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:49,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 485 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-24 11:42:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 732. [2024-10-24 11:42:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 641 states have (on average 1.2464898595943839) internal successors, (799), 648 states have internal predecessors, (799), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 11:42:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 943 transitions. [2024-10-24 11:42:49,191 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 943 transitions. Word has length 159 [2024-10-24 11:42:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:49,192 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 943 transitions. [2024-10-24 11:42:49,192 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 943 transitions. [2024-10-24 11:42:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-24 11:42:49,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:49,193 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:49,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 11:42:49,194 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:49,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1973298923, now seen corresponding path program 1 times [2024-10-24 11:42:49,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:49,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585989316] [2024-10-24 11:42:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:42:49,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:42:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:42:49,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:42:49,562 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:42:49,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:42:49,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 11:42:49,568 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:49,783 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:42:49,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:42:49 BoogieIcfgContainer [2024-10-24 11:42:49,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:42:49,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:42:49,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:42:49,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:42:49,788 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:23" (3/4) ... [2024-10-24 11:42:49,790 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:42:49,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:42:49,791 INFO L158 Benchmark]: Toolchain (without parser) took 27899.55ms. Allocated memory was 121.6MB in the beginning and 750.8MB in the end (delta: 629.1MB). Free memory was 52.5MB in the beginning and 278.2MB in the end (delta: -225.7MB). Peak memory consumption was 406.2MB. Max. memory is 16.1GB. [2024-10-24 11:42:49,792 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:42:49,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.01ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 52.3MB in the beginning and 120.2MB in the end (delta: -67.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-10-24 11:42:49,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.07ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 116.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:42:49,793 INFO L158 Benchmark]: Boogie Preprocessor took 145.81ms. Allocated memory is still 153.1MB. Free memory was 116.1MB in the beginning and 109.7MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:42:49,794 INFO L158 Benchmark]: RCFGBuilder took 898.84ms. Allocated memory is still 153.1MB. Free memory was 109.3MB in the beginning and 114.2MB in the end (delta: -4.9MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-24 11:42:49,794 INFO L158 Benchmark]: TraceAbstraction took 26380.80ms. Allocated memory was 153.1MB in the beginning and 750.8MB in the end (delta: 597.7MB). Free memory was 113.1MB in the beginning and 278.2MB in the end (delta: -165.1MB). Peak memory consumption was 432.5MB. Max. memory is 16.1GB. [2024-10-24 11:42:49,794 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 750.8MB. Free memory is still 278.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:42:49,797 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.15ms. Allocated memory is still 121.6MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.01ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 52.3MB in the beginning and 120.2MB in the end (delta: -67.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.07ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 116.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 145.81ms. Allocated memory is still 153.1MB. Free memory was 116.1MB in the beginning and 109.7MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 898.84ms. Allocated memory is still 153.1MB. Free memory was 109.3MB in the beginning and 114.2MB in the end (delta: -4.9MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26380.80ms. Allocated memory was 153.1MB in the beginning and 750.8MB in the end (delta: 597.7MB). Free memory was 113.1MB in the beginning and 278.2MB in the end (delta: -165.1MB). Peak memory consumption was 432.5MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 750.8MB. Free memory is still 278.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L22] unsigned char var_1_1 = 128; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 25; [L24] unsigned char var_1_4 = 25; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 64; [L26] unsigned char var_1_5 = 64; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] unsigned char var_1_6 = 8; [L28] unsigned char var_1_6 = 8; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_7 = 0; [L30] unsigned char var_1_7 = 0; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned short int var_1_8 = 64; [L32] unsigned short int var_1_8 = 64; [L33] unsigned short int* var_1_8_Pointer = &(var_1_8); [L34] unsigned char var_1_9 = 1; [L34] unsigned char var_1_9 = 1; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] unsigned short int var_1_10 = 27843; [L36] unsigned short int var_1_10 = 27843; [L37] unsigned short int* var_1_10_Pointer = &(var_1_10); [L38] signed short int var_1_11 = -4; [L38] signed short int var_1_11 = -4; [L39] signed short int* var_1_11_Pointer = &(var_1_11); [L40] unsigned char var_1_13 = 128; [L40] unsigned char var_1_13 = 128; [L41] unsigned char* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 5; [L42] unsigned char var_1_14 = 5; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] signed short int var_1_15 = 28020; [L44] signed short int var_1_15 = 28020; [L45] signed short int* var_1_15_Pointer = &(var_1_15); [L46] signed short int var_1_16 = 128; [L46] signed short int var_1_16 = 128; [L47] signed short int* var_1_16_Pointer = &(var_1_16); [L48] float var_1_17 = 10000000000000.926; [L48] float var_1_17 = 10000000000000.926; [L49] float* var_1_17_Pointer = &(var_1_17); [L50] float var_1_18 = 1000000.6; [L50] float var_1_18 = 1000000.6; [L51] float* var_1_18_Pointer = &(var_1_18); [L52] unsigned short int last_1_var_1_8 = 64; [L53] signed short int last_1_var_1_11 = -4; [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L111] EXPR \read(var_1_8) [L111] last_1_var_1_8 = var_1_8 [L112] EXPR \read(var_1_11) [L112] last_1_var_1_11 = var_1_11 [L122] RET updateLastVariables() [L123] CALL updateVariables() [L79] var_1_4 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] var_1_5 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] var_1_6 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_7 = __VERIFIER_nondet_uchar() [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] var_1_9 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] var_1_10 = __VERIFIER_nondet_ushort() [L95] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_13 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_13 >= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_13 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_13 <= 255) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] var_1_14 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_14 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_14 != 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] var_1_15 = __VERIFIER_nondet_short() [L105] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] var_1_18 = __VERIFIER_nondet_float() [L108] EXPR \read(var_1_18) [L108] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F [L108] EXPR \read(var_1_18) [L108] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L123] RET updateVariables() [L124] CALL step() [L57] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, stepLocal_0=-4, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L58] COND TRUE stepLocal_0 != last_1_var_1_8 [L59] EXPR \read(*var_1_4_Pointer) [L59] EXPR \read(*var_1_5_Pointer) [L59] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] EXPR (((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer))) [L59] EXPR \read(*var_1_5_Pointer) [L59] EXPR (((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] EXPR (((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer))) [L59] EXPR \read(*var_1_7_Pointer) [L59] EXPR (((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] (*(var_1_1_Pointer)) = ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))) [L63] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] COND TRUE (*(var_1_9_Pointer)) [L64] EXPR \read(*var_1_10_Pointer) [L64] EXPR \read(*var_1_6_Pointer) [L64] (*(var_1_8_Pointer)) = (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))) [L66] EXPR \read(*var_1_5_Pointer) [L66] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L66] COND TRUE ! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer))) [L67] (*(var_1_16_Pointer)) = (32 - 8) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] EXPR \read(*var_1_18_Pointer) [L71] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L72] EXPR \read(*var_1_1_Pointer) [L72] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] COND FALSE !((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR (last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer)))) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR \read(*var_1_4_Pointer) [L115] EXPR \read(*var_1_5_Pointer) [L115] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer))) [L115] EXPR \read(*var_1_5_Pointer) [L115] EXPR (((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer))) [L115] EXPR \read(*var_1_7_Pointer) [L115] EXPR (((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer)))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1) [L115] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1 [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_6_Pointer) [L115] EXPR (*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1 VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1 [L115] EXPR ((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))))) [L115] EXPR \read(*var_1_5_Pointer) [L115] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))) [L115] EXPR \read(*var_1_16_Pointer) [L115] EXPR (! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) [L115] EXPR \read(*var_1_17_Pointer) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR (((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115-L116] return (((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.1s, OverallIterations: 25, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3416 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3416 mSDsluCounter, 18193 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14698 mSDsCounter, 375 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6085 IncrementalHoareTripleChecker+Invalid, 6460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 375 mSolverCounterUnsat, 3495 mSDtfsCounter, 6085 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1303 GetRequests, 1054 SyntacticMatches, 1 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=783occurred in iteration=12, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 2386 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 3863 NumberOfCodeBlocks, 3863 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3680 ConstructedInterpolants, 0 QuantifiedInterpolants, 10480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 18240/18240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:42:49,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.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 e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:42:52,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:42:52,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:42:52,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:42:52,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:42:52,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:42:52,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:42:52,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:42:52,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:42:52,179 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:42:52,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:42:52,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:42:52,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:42:52,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:42:52,183 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:42:52,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:42:52,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:42:52,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:42:52,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:42:52,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:42:52,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:42:52,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:42:52,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:42:52,191 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:42:52,191 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:42:52,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:42:52,192 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:42:52,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:42:52,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:42:52,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:42:52,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:42:52,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:42:52,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:42:52,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:42:52,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:52,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:42:52,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:42:52,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:42:52,194 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:42:52,195 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:42:52,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:42:52,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:42:52,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:42:52,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:42:52,197 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:42:52,197 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 -> e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 [2024-10-24 11:42:52,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:42:52,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:42:52,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:42:52,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:42:52,536 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:42:52,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2024-10-24 11:42:54,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:42:54,361 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:42:54,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2024-10-24 11:42:54,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d798f7c/029fe60a5d2a4e4f813f63ba9f45ba1c/FLAGd3c205cdf [2024-10-24 11:42:54,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d798f7c/029fe60a5d2a4e4f813f63ba9f45ba1c [2024-10-24 11:42:54,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:42:54,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:42:54,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:54,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:42:54,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:42:54,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:54" (1/1) ... [2024-10-24 11:42:54,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448ad4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:54, skipping insertion in model container [2024-10-24 11:42:54,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:54" (1/1) ... [2024-10-24 11:42:54,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:42:54,945 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2024-10-24 11:42:55,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:55,037 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:42:55,049 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2024-10-24 11:42:55,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:55,107 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:42:55,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55 WrapperNode [2024-10-24 11:42:55,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:55,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:55,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:42:55,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:42:55,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,184 INFO L138 Inliner]: procedures = 33, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-10-24 11:42:55,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:55,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:42:55,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:42:55,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:42:55,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,243 INFO L175 MemorySlicer]: Split 122 memory accesses to 16 slices as follows [2, 7, 10, 14, 16, 8, 4, 6, 8, 4, 8, 9, 6, 9, 3, 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, 1, 1, 1, 1, 1, 1, 2, 1, 1]. [2024-10-24 11:42:55,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:42:55,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:42:55,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:42:55,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:42:55,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (1/1) ... [2024-10-24 11:42:55,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:55,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:55,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:42:55,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:42:55,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:42:55,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:42:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:42:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:42:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:42:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:42:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:42:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-24 11:42:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-24 11:42:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-24 11:42:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-24 11:42:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-24 11:42:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-24 11:42:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-24 11:42:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-24 11:42:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-24 11:42:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-24 11:42:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:42:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:42:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:42:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:42:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:42:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:42:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-24 11:42:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-24 11:42:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-24 11:42:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-24 11:42:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-24 11:42:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-24 11:42:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-24 11:42:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-24 11:42:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-24 11:42:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-24 11:42:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:42:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:42:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:42:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:42:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:42:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:42:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-24 11:42:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-24 11:42:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-24 11:42:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-24 11:42:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-24 11:42:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-24 11:42:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-24 11:42:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-24 11:42:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-24 11:42:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-24 11:42:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:42:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:42:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:42:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:42:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:42:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:42:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-24 11:42:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-24 11:42:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-24 11:42:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-24 11:42:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-24 11:42:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-24 11:42:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-24 11:42:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-24 11:42:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-24 11:42:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-24 11:42:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:42:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:42:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:42:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:42:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:42:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:42:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-24 11:42:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-24 11:42:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-24 11:42:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-24 11:42:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-24 11:42:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-24 11:42:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-24 11:42:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-24 11:42:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-24 11:42:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-24 11:42:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:42:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:42:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:42:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:42:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:42:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:42:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-24 11:42:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-24 11:42:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-24 11:42:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-24 11:42:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-24 11:42:55,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-24 11:42:55,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-24 11:42:55,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-24 11:42:55,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-24 11:42:55,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-24 11:42:55,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:42:55,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:42:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:42:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:42:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:42:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:42:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-24 11:42:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-24 11:42:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-24 11:42:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-24 11:42:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-24 11:42:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-24 11:42:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-24 11:42:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-24 11:42:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-24 11:42:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-24 11:42:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:42:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:42:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:42:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:42:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:42:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:42:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-24 11:42:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-24 11:42:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-24 11:42:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-24 11:42:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:42:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:42:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:42:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:42:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:42:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:42:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-24 11:42:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-24 11:42:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-24 11:42:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-24 11:42:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-24 11:42:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-24 11:42:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-24 11:42:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-24 11:42:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-24 11:42:55,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-24 11:42:55,690 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:42:55,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:42:56,337 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-24 11:42:56,337 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:42:56,408 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:42:56,411 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:42:56,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:56 BoogieIcfgContainer [2024-10-24 11:42:56,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:42:56,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:42:56,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:42:56,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:42:56,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:42:54" (1/3) ... [2024-10-24 11:42:56,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728b004c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:42:56, skipping insertion in model container [2024-10-24 11:42:56,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:55" (2/3) ... [2024-10-24 11:42:56,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728b004c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:42:56, skipping insertion in model container [2024-10-24 11:42:56,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:56" (3/3) ... [2024-10-24 11:42:56,422 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-84.i [2024-10-24 11:42:56,440 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:42:56,440 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:42:56,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:42:56,526 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;@49e773ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:42:56,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:42:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:42:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 11:42:56,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:56,548 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:56,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:56,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1918731661, now seen corresponding path program 1 times [2024-10-24 11:42:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:42:56,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745242822] [2024-10-24 11:42:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:42:56,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:42:56,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:42:56,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:42:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:57,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:42:57,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-24 11:42:57,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:42:57,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:42:57,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745242822] [2024-10-24 11:42:57,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745242822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:57,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:57,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:42:57,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973344968] [2024-10-24 11:42:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:57,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:42:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:42:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:42:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:42:57,145 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 11:42:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:57,205 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-24 11:42:57,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:42:57,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-24 11:42:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:57,216 INFO L225 Difference]: With dead ends: 189 [2024-10-24 11:42:57,216 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 11:42:57,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:42:57,224 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:57,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 11:42:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 11:42:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:42:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-24 11:42:57,279 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 145 [2024-10-24 11:42:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:57,280 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-24 11:42:57,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 11:42:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-24 11:42:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 11:42:57,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:57,285 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:57,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:42:57,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:42:57,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:57,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:57,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1521079025, now seen corresponding path program 1 times [2024-10-24 11:42:57,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:42:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418906504] [2024-10-24 11:42:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:57,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:42:57,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:42:57,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:42:57,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:42:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:57,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:42:57,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:57,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:42:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:58,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:42:58,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:42:58,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418906504] [2024-10-24 11:42:58,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418906504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:58,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:58,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:42:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810717052] [2024-10-24 11:42:58,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:58,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:42:58,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:58,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:58,284 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:58,592 INFO L93 Difference]: Finished difference Result 310 states and 448 transitions. [2024-10-24 11:42:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:58,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-24 11:42:58,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:58,596 INFO L225 Difference]: With dead ends: 310 [2024-10-24 11:42:58,596 INFO L226 Difference]: Without dead ends: 217 [2024-10-24 11:42:58,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:42:58,601 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 199 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:58,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 513 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-24 11:42:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 187. [2024-10-24 11:42:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.3194444444444444) internal successors, (190), 144 states have internal predecessors, (190), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:42:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 270 transitions. [2024-10-24 11:42:58,640 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 270 transitions. Word has length 145 [2024-10-24 11:42:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:58,641 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 270 transitions. [2024-10-24 11:42:58,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 270 transitions. [2024-10-24 11:42:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 11:42:58,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:58,646 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:58,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:42:58,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:42:58,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:58,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash 191318547, now seen corresponding path program 1 times [2024-10-24 11:42:58,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:42:58,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538818376] [2024-10-24 11:42:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:58,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:42:58,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:42:58,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:42:58,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:42:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:59,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:42:59,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:42:59,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:42:59,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:42:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538818376] [2024-10-24 11:42:59,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538818376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:59,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:59,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:42:59,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441158546] [2024-10-24 11:42:59,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:59,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:42:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:42:59,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:42:59,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:42:59,283 INFO L87 Difference]: Start difference. First operand 187 states and 270 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:59,388 INFO L93 Difference]: Finished difference Result 387 states and 559 transitions. [2024-10-24 11:42:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:42:59,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-10-24 11:42:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:59,393 INFO L225 Difference]: With dead ends: 387 [2024-10-24 11:42:59,394 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 11:42:59,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:42:59,397 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:59,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 617 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 11:42:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-10-24 11:42:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.294871794871795) internal successors, (202), 156 states have internal predecessors, (202), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:42:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2024-10-24 11:42:59,429 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 153 [2024-10-24 11:42:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:59,429 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2024-10-24 11:42:59,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:42:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2024-10-24 11:42:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 11:42:59,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:59,436 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:59,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:42:59,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:42:59,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:59,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash 191378129, now seen corresponding path program 1 times [2024-10-24 11:42:59,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:42:59,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283686745] [2024-10-24 11:42:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:59,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:42:59,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:42:59,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:42:59,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:42:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:59,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:43:00,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:00,365 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 27 treesize of output 23 [2024-10-24 11:43:00,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-10-24 11:43:00,444 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 28 treesize of output 20 [2024-10-24 11:43:00,536 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-10-24 11:43:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-24 11:43:00,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:03,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:03,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283686745] [2024-10-24 11:43:03,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283686745] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:03,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:03,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2024-10-24 11:43:03,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216090604] [2024-10-24 11:43:03,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:03,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:43:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:43:03,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:43:03,913 INFO L87 Difference]: Start difference. First operand 199 states and 282 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:04,427 INFO L93 Difference]: Finished difference Result 491 states and 691 transitions. [2024-10-24 11:43:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:43:04,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-10-24 11:43:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:04,432 INFO L225 Difference]: With dead ends: 491 [2024-10-24 11:43:04,432 INFO L226 Difference]: Without dead ends: 293 [2024-10-24 11:43:04,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:43:04,436 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 60 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:04,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1002 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:43:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-24 11:43:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2024-10-24 11:43:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 190 states have (on average 1.3105263157894738) internal successors, (249), 190 states have internal predecessors, (249), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:43:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2024-10-24 11:43:04,470 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 153 [2024-10-24 11:43:04,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:04,470 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2024-10-24 11:43:04,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2024-10-24 11:43:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:04,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:04,473 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:04,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 (5)] Ended with exit code 0 [2024-10-24 11:43:04,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:04,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:04,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1107459412, now seen corresponding path program 1 times [2024-10-24 11:43:04,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:04,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193041575] [2024-10-24 11:43:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:04,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:04,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:04,681 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:04,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:43:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:43:05,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:06,511 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-10-24 11:43:06,571 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 20 treesize of output 12 [2024-10-24 11:43:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 457 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 11:43:06,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:06,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:06,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193041575] [2024-10-24 11:43:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193041575] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:06,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:06,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-10-24 11:43:06,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101566614] [2024-10-24 11:43:06,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:06,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:43:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:06,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:43:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:43:06,977 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:07,322 INFO L93 Difference]: Finished difference Result 581 states and 813 transitions. [2024-10-24 11:43:07,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:43:07,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:07,326 INFO L225 Difference]: With dead ends: 581 [2024-10-24 11:43:07,326 INFO L226 Difference]: Without dead ends: 349 [2024-10-24 11:43:07,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-10-24 11:43:07,328 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 162 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:07,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 680 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:43:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-24 11:43:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2024-10-24 11:43:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 296 states have (on average 1.3243243243243243) internal successors, (392), 298 states have internal predecessors, (392), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:43:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 480 transitions. [2024-10-24 11:43:07,353 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 480 transitions. Word has length 155 [2024-10-24 11:43:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:07,354 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 480 transitions. [2024-10-24 11:43:07,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 480 transitions. [2024-10-24 11:43:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:07,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:07,357 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:07,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:43:07,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:07,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:07,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:07,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1907644206, now seen corresponding path program 1 times [2024-10-24 11:43:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:07,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021647804] [2024-10-24 11:43:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:07,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:07,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:07,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:07,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:43:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 11:43:07,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:09,959 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 39 treesize of output 27 [2024-10-24 11:43:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 14 proven. 470 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-24 11:43:10,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:10,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:10,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021647804] [2024-10-24 11:43:10,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021647804] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:10,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:10,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 30 [2024-10-24 11:43:10,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988312607] [2024-10-24 11:43:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:10,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:43:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:10,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:43:10,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2024-10-24 11:43:10,528 INFO L87 Difference]: Start difference. First operand 345 states and 480 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:11,239 INFO L93 Difference]: Finished difference Result 896 states and 1236 transitions. [2024-10-24 11:43:11,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:43:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:11,244 INFO L225 Difference]: With dead ends: 896 [2024-10-24 11:43:11,244 INFO L226 Difference]: Without dead ends: 552 [2024-10-24 11:43:11,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 11:43:11,246 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 151 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:11,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 953 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:43:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-24 11:43:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 353. [2024-10-24 11:43:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 304 states have (on average 1.332236842105263) internal successors, (405), 306 states have internal predecessors, (405), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:43:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 493 transitions. [2024-10-24 11:43:11,268 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 493 transitions. Word has length 155 [2024-10-24 11:43:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:11,269 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 493 transitions. [2024-10-24 11:43:11,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 493 transitions. [2024-10-24 11:43:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:11,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:11,271 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:11,282 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-10-24 11:43:11,472 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-10-24 11:43:11,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1353532792, now seen corresponding path program 1 times [2024-10-24 11:43:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:11,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552761323] [2024-10-24 11:43:11,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:11,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:11,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:11,477 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-10-24 11:43:11,478 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-10-24 11:43:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:11,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:43:11,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:12,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-24 11:43:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 10 proven. 426 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-24 11:43:12,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:12,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:12,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552761323] [2024-10-24 11:43:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552761323] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-24 11:43:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124423371] [2024-10-24 11:43:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:12,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:12,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:12,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:43:12,454 INFO L87 Difference]: Start difference. First operand 353 states and 493 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:12,560 INFO L93 Difference]: Finished difference Result 959 states and 1331 transitions. [2024-10-24 11:43:12,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:12,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:12,567 INFO L225 Difference]: With dead ends: 959 [2024-10-24 11:43:12,568 INFO L226 Difference]: Without dead ends: 607 [2024-10-24 11:43:12,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:43:12,570 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:12,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 503 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-24 11:43:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2024-10-24 11:43:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 530 states have (on average 1.3283018867924528) internal successors, (704), 536 states have internal predecessors, (704), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 11:43:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 832 transitions. [2024-10-24 11:43:12,624 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 832 transitions. Word has length 155 [2024-10-24 11:43:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:12,625 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 832 transitions. [2024-10-24 11:43:12,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 832 transitions. [2024-10-24 11:43:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:12,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:12,628 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:12,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 11:43:12,831 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-10-24 11:43:12,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:12,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash 652468214, now seen corresponding path program 1 times [2024-10-24 11:43:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255092527] [2024-10-24 11:43:12,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:12,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:12,837 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:12,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:43:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:13,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:43:13,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:14,461 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 31 treesize of output 27 [2024-10-24 11:43:14,681 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 114 treesize of output 94 [2024-10-24 11:43:14,690 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 93 treesize of output 77 [2024-10-24 11:43:14,696 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 72 treesize of output 60 [2024-10-24 11:43:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 28 proven. 552 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:43:14,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:14,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255092527] [2024-10-24 11:43:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255092527] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:14,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20] total 23 [2024-10-24 11:43:14,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308325206] [2024-10-24 11:43:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:14,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:14,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:14,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:14,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:43:14,998 INFO L87 Difference]: Start difference. First operand 603 states and 832 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:15,283 INFO L93 Difference]: Finished difference Result 1240 states and 1702 transitions. [2024-10-24 11:43:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:43:15,284 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:15,289 INFO L225 Difference]: With dead ends: 1240 [2024-10-24 11:43:15,289 INFO L226 Difference]: Without dead ends: 638 [2024-10-24 11:43:15,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-10-24 11:43:15,291 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 52 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:15,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 637 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:43:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-10-24 11:43:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2024-10-24 11:43:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 555 states have (on average 1.3063063063063063) internal successors, (725), 562 states have internal predecessors, (725), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 11:43:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 861 transitions. [2024-10-24 11:43:15,326 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 861 transitions. Word has length 155 [2024-10-24 11:43:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:15,327 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 861 transitions. [2024-10-24 11:43:15,327 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 861 transitions. [2024-10-24 11:43:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:15,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:15,331 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:15,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:43:15,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:15,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:15,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1333670196, now seen corresponding path program 1 times [2024-10-24 11:43:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:15,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984121358] [2024-10-24 11:43:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:15,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:15,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:15,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:15,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 11:43:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:15,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:43:15,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:16,876 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-10-24 11:43:16,932 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 18 [2024-10-24 11:43:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 457 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 11:43:17,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:17,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:17,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984121358] [2024-10-24 11:43:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984121358] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:17,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:17,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-10-24 11:43:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636265823] [2024-10-24 11:43:17,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:17,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:43:17,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:43:17,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:43:17,250 INFO L87 Difference]: Start difference. First operand 635 states and 861 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:17,521 INFO L93 Difference]: Finished difference Result 1483 states and 1999 transitions. [2024-10-24 11:43:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:43:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:17,526 INFO L225 Difference]: With dead ends: 1483 [2024-10-24 11:43:17,526 INFO L226 Difference]: Without dead ends: 861 [2024-10-24 11:43:17,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-10-24 11:43:17,531 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 159 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:17,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 602 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:43:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-24 11:43:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 705. [2024-10-24 11:43:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 625 states have (on average 1.3104) internal successors, (819), 632 states have internal predecessors, (819), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 11:43:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 955 transitions. [2024-10-24 11:43:17,565 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 955 transitions. Word has length 155 [2024-10-24 11:43:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:17,567 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 955 transitions. [2024-10-24 11:43:17,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 955 transitions. [2024-10-24 11:43:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:17,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:17,570 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:17,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 11:43:17,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:17,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:17,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1372949198, now seen corresponding path program 1 times [2024-10-24 11:43:17,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:17,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633259497] [2024-10-24 11:43:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:17,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:17,774 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:17,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 11:43:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:18,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 11:43:18,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:19,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-10-24 11:43:19,129 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 17 [2024-10-24 11:43:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-24 11:43:19,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:19,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633259497] [2024-10-24 11:43:19,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633259497] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:19,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:19,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-24 11:43:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346518193] [2024-10-24 11:43:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:19,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:19,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:19,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:19,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:43:19,353 INFO L87 Difference]: Start difference. First operand 705 states and 955 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:19,511 INFO L93 Difference]: Finished difference Result 1553 states and 2085 transitions. [2024-10-24 11:43:19,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:19,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:19,518 INFO L225 Difference]: With dead ends: 1553 [2024-10-24 11:43:19,519 INFO L226 Difference]: Without dead ends: 861 [2024-10-24 11:43:19,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:43:19,521 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 110 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:19,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 366 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-24 11:43:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 697. [2024-10-24 11:43:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 617 states have (on average 1.2949756888168558) internal successors, (799), 624 states have internal predecessors, (799), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 11:43:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 935 transitions. [2024-10-24 11:43:19,555 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 935 transitions. Word has length 155 [2024-10-24 11:43:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:19,556 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 935 transitions. [2024-10-24 11:43:19,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 935 transitions. [2024-10-24 11:43:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:19,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:19,558 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:19,569 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 (11)] Forceful destruction successful, exit code 0 [2024-10-24 11:43:19,758 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-10-24 11:43:19,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:19,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 518454708, now seen corresponding path program 1 times [2024-10-24 11:43:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727068061] [2024-10-24 11:43:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:19,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:19,764 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-10-24 11:43:19,765 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-10-24 11:43:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:20,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:43:20,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 10 proven. 426 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-24 11:43:20,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:20,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:20,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727068061] [2024-10-24 11:43:20,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727068061] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:20,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:20,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-24 11:43:20,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755137150] [2024-10-24 11:43:20,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:20,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:20,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:20,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:20,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:43:20,616 INFO L87 Difference]: Start difference. First operand 697 states and 935 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:20,723 INFO L93 Difference]: Finished difference Result 1381 states and 1847 transitions. [2024-10-24 11:43:20,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:20,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:20,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:20,727 INFO L225 Difference]: With dead ends: 1381 [2024-10-24 11:43:20,727 INFO L226 Difference]: Without dead ends: 697 [2024-10-24 11:43:20,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 299 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-10-24 11:43:20,729 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 64 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:20,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 645 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-24 11:43:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 693. [2024-10-24 11:43:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 611 states have (on average 1.2847790507364976) internal successors, (785), 618 states have internal predecessors, (785), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 11:43:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 921 transitions. [2024-10-24 11:43:20,765 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 921 transitions. Word has length 155 [2024-10-24 11:43:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:20,766 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 921 transitions. [2024-10-24 11:43:20,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 921 transitions. [2024-10-24 11:43:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:20,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:20,768 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:20,780 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 (12)] Forceful destruction successful, exit code 0 [2024-10-24 11:43:20,969 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-10-24 11:43:20,969 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:20,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash 278743982, now seen corresponding path program 1 times [2024-10-24 11:43:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:20,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097322676] [2024-10-24 11:43:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:20,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:20,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:20,972 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-10-24 11:43:20,973 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-10-24 11:43:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:21,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 11:43:21,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:22,063 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-10-24 11:43:22,068 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-10-24 11:43:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-24 11:43:22,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:22,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:22,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097322676] [2024-10-24 11:43:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097322676] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:22,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:22,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-24 11:43:22,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114577548] [2024-10-24 11:43:22,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:22,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:22,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:43:22,267 INFO L87 Difference]: Start difference. First operand 693 states and 921 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:22,446 INFO L93 Difference]: Finished difference Result 1611 states and 2115 transitions. [2024-10-24 11:43:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:22,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:22,455 INFO L225 Difference]: With dead ends: 1611 [2024-10-24 11:43:22,455 INFO L226 Difference]: Without dead ends: 931 [2024-10-24 11:43:22,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:43:22,457 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 128 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:22,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 415 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-10-24 11:43:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 593. [2024-10-24 11:43:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 525 states have (on average 1.2971428571428572) internal successors, (681), 529 states have internal predecessors, (681), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 11:43:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 793 transitions. [2024-10-24 11:43:22,488 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 793 transitions. Word has length 155 [2024-10-24 11:43:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:22,489 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 793 transitions. [2024-10-24 11:43:22,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 793 transitions. [2024-10-24 11:43:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:22,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:22,492 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:22,503 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-10-24 11:43:22,693 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-10-24 11:43:22,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:22,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:22,694 INFO L85 PathProgramCache]: Analyzing trace with hash 340783596, now seen corresponding path program 1 times [2024-10-24 11:43:22,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:22,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566324452] [2024-10-24 11:43:22,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:22,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:22,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:22,695 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-10-24 11:43:22,696 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-10-24 11:43:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:23,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 11:43:23,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:23,844 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-10-24 11:43:23,849 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-10-24 11:43:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-24 11:43:23,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:24,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:24,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566324452] [2024-10-24 11:43:24,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566324452] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:24,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:24,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-24 11:43:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398376403] [2024-10-24 11:43:24,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:24,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:24,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:24,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:43:24,086 INFO L87 Difference]: Start difference. First operand 593 states and 793 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:24,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:24,235 INFO L93 Difference]: Finished difference Result 1347 states and 1778 transitions. [2024-10-24 11:43:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:24,240 INFO L225 Difference]: With dead ends: 1347 [2024-10-24 11:43:24,240 INFO L226 Difference]: Without dead ends: 755 [2024-10-24 11:43:24,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:43:24,242 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 104 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:24,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 418 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-24 11:43:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 585. [2024-10-24 11:43:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 517 states have (on average 1.2785299806576402) internal successors, (661), 521 states have internal predecessors, (661), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 11:43:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 773 transitions. [2024-10-24 11:43:24,265 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 773 transitions. Word has length 155 [2024-10-24 11:43:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:24,266 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 773 transitions. [2024-10-24 11:43:24,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 773 transitions. [2024-10-24 11:43:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:24,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:24,268 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:24,278 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-10-24 11:43:24,468 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-10-24 11:43:24,469 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:24,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1535814704, now seen corresponding path program 1 times [2024-10-24 11:43:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294859539] [2024-10-24 11:43:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:24,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:24,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:24,474 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-10-24 11:43:24,476 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-10-24 11:43:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:24,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 11:43:24,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:25,879 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-10-24 11:43:25,882 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-10-24 11:43:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-24 11:43:25,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:43:26,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294859539] [2024-10-24 11:43:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294859539] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:26,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:26,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-24 11:43:26,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909404919] [2024-10-24 11:43:26,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:26,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:26,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:26,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:43:26,106 INFO L87 Difference]: Start difference. First operand 585 states and 773 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:26,240 INFO L93 Difference]: Finished difference Result 1339 states and 1750 transitions. [2024-10-24 11:43:26,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:26,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-24 11:43:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:26,244 INFO L225 Difference]: With dead ends: 1339 [2024-10-24 11:43:26,245 INFO L226 Difference]: Without dead ends: 755 [2024-10-24 11:43:26,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:43:26,247 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 100 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:26,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 421 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-24 11:43:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 597. [2024-10-24 11:43:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 529 states have (on average 1.272211720226843) internal successors, (673), 533 states have internal predecessors, (673), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 11:43:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 785 transitions. [2024-10-24 11:43:26,275 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 785 transitions. Word has length 155 [2024-10-24 11:43:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:26,276 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 785 transitions. [2024-10-24 11:43:26,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 11:43:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 785 transitions. [2024-10-24 11:43:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:43:26,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:26,279 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:43:26,290 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 (15)] Ended with exit code 0 [2024-10-24 11:43:26,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:26,483 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:26,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1748035342, now seen corresponding path program 1 times [2024-10-24 11:43:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:26,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345555240] [2024-10-24 11:43:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:26,488 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:26,489 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 (16)] Waiting until timeout for monitored process [2024-10-24 11:43:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:26,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:43:26,939 INFO L278 TraceCheckSpWp]: Computing forward predicates...