./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-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:44:15,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:44:16,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:44:16,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:44:16,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:44:16,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:44:16,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:44:16,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:44:16,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:44:16,054 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:44:16,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:44:16,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:44:16,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:44:16,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:44:16,056 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:44:16,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:44:16,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:44:16,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:44:16,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:44:16,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:44:16,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:44:16,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:44:16,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:44:16,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:44:16,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:44:16,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:44:16,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:44:16,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:44:16,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:44:16,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:44:16,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:44:16,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:44:16,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:44:16,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:44:16,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:44:16,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:44:16,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:44:16,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:44:16,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:44:16,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:44:16,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:44:16,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:44:16,069 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-clean/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-clean/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 -> 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b [2024-10-11 13:44:16,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:44:16,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:44:16,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:44:16,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:44:16,379 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:44:16,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-11 13:44:17,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:44:18,021 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:44:18,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-11 13:44:18,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1b20647bd/7a71a013b25345d38793f5349b5fb860/FLAGa65391b63 [2024-10-11 13:44:18,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1b20647bd/7a71a013b25345d38793f5349b5fb860 [2024-10-11 13:44:18,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:44:18,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:44:18,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:44:18,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:44:18,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:44:18,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c51bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18, skipping insertion in model container [2024-10-11 13:44:18,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:44:18,288 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-97.i[916,929] [2024-10-11 13:44:18,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:44:18,363 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:44:18,374 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-97.i[916,929] [2024-10-11 13:44:18,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:44:18,426 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:44:18,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18 WrapperNode [2024-10-11 13:44:18,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:44:18,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:44:18,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:44:18,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:44:18,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,501 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2024-10-11 13:44:18,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:44:18,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:44:18,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:44:18,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:44:18,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,545 INFO L175 MemorySlicer]: Split 116 memory accesses to 16 slices as follows [2, 7, 8, 6, 6, 7, 8, 10, 11, 8, 6, 7, 6, 9, 8, 7]. 9 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 19 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-10-11 13:44:18,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:44:18,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:44:18,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:44:18,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:44:18,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (1/1) ... [2024-10-11 13:44:18,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:44:18,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:44:18,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:44:18,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:44:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:44:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:44:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:44:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:44:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:44:18,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:44:18,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:44:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:44:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:44:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:44:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:44:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 13:44:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 13:44:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:44:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:44:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:44:18,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:44:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:44:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:44:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:44:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:44:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:44:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:44:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:44:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:44:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:44:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:44:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-11 13:44:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-11 13:44:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:44:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:44:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:44:18,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:44:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:44:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:44:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:44:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:44:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:44:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:44:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:44:18,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:44:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:44:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:44:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:44:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:44:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:44:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:44:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-11 13:44:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-11 13:44:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:44:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:44:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:44:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:44:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 13:44:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 13:44:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:44:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:44:18,907 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:44:18,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:44:19,437 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-11 13:44:19,437 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:44:19,474 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:44:19,475 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:44:19,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:19 BoogieIcfgContainer [2024-10-11 13:44:19,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:44:19,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:44:19,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:44:19,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:44:19,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:44:18" (1/3) ... [2024-10-11 13:44:19,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e5c250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:19, skipping insertion in model container [2024-10-11 13:44:19,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:18" (2/3) ... [2024-10-11 13:44:19,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e5c250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:19, skipping insertion in model container [2024-10-11 13:44:19,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:19" (3/3) ... [2024-10-11 13:44:19,485 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-97.i [2024-10-11 13:44:19,500 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:44:19,500 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:44:19,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:44:19,563 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;@4d6a0758, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:44:19,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:44:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:44:19,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:19,582 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:19,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:19,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:19,588 INFO L85 PathProgramCache]: Analyzing trace with hash -872643146, now seen corresponding path program 1 times [2024-10-11 13:44:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:19,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744561930] [2024-10-11 13:44:19,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:19,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:20,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:20,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744561930] [2024-10-11 13:44:20,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744561930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:20,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:20,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:44:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974933553] [2024-10-11 13:44:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:20,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:44:20,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:20,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:44:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:44:20,249 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:44:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:20,301 INFO L93 Difference]: Finished difference Result 199 states and 315 transitions. [2024-10-11 13:44:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:44:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-11 13:44:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:20,316 INFO L225 Difference]: With dead ends: 199 [2024-10-11 13:44:20,316 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 13:44:20,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-11 13:44:20,327 INFO L432 NwaCegarLoop]: 141 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, 141 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-11 13:44:20,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:20,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 13:44:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 13:44:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-10-11 13:44:20,374 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 129 [2024-10-11 13:44:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:20,375 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-10-11 13:44:20,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:44:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-10-11 13:44:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:44:20,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:20,380 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:20,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:44:20,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:20,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash -716066796, now seen corresponding path program 1 times [2024-10-11 13:44:20,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:20,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337798162] [2024-10-11 13:44:20,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:20,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:20,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337798162] [2024-10-11 13:44:20,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337798162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:20,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:20,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:44:20,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76962721] [2024-10-11 13:44:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:20,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:44:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:20,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:44:20,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:44:20,912 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:20,974 INFO L93 Difference]: Finished difference Result 199 states and 292 transitions. [2024-10-11 13:44:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:44:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-11 13:44:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:20,978 INFO L225 Difference]: With dead ends: 199 [2024-10-11 13:44:20,978 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 13:44:20,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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-11 13:44:20,980 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:20,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 13:44:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 13:44:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-10-11 13:44:20,993 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 129 [2024-10-11 13:44:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:20,995 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-10-11 13:44:20,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-10-11 13:44:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:44:20,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:20,999 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:21,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:44:21,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:21,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash 595986690, now seen corresponding path program 1 times [2024-10-11 13:44:21,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:21,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395929122] [2024-10-11 13:44:21,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:21,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:21,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395929122] [2024-10-11 13:44:21,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395929122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:21,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:21,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:44:21,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287099042] [2024-10-11 13:44:21,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:21,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:44:21,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:21,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:44:21,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:44:21,245 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:21,293 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2024-10-11 13:44:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:44:21,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 13:44:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:21,295 INFO L225 Difference]: With dead ends: 204 [2024-10-11 13:44:21,295 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 13:44:21,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-11 13:44:21,297 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:21,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 407 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 13:44:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-11 13:44:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-10-11 13:44:21,307 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 131 [2024-10-11 13:44:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:21,308 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-10-11 13:44:21,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-10-11 13:44:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:44:21,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:21,311 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:21,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:44:21,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:21,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash -213359936, now seen corresponding path program 1 times [2024-10-11 13:44:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:21,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428986323] [2024-10-11 13:44:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:21,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428986323] [2024-10-11 13:44:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428986323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:21,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:21,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:44:21,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842071035] [2024-10-11 13:44:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:21,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:44:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:21,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:44:21,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:44:21,508 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:21,546 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2024-10-11 13:44:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:44:21,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 13:44:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:21,548 INFO L225 Difference]: With dead ends: 208 [2024-10-11 13:44:21,548 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 13:44:21,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-11 13:44:21,550 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:21,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 408 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 13:44:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-11 13:44:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-10-11 13:44:21,558 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 131 [2024-10-11 13:44:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:21,559 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-10-11 13:44:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-10-11 13:44:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:44:21,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:21,564 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:21,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:44:21,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:21,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash -156101634, now seen corresponding path program 1 times [2024-10-11 13:44:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:21,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031004602] [2024-10-11 13:44:21,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:21,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:21,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:21,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031004602] [2024-10-11 13:44:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031004602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:21,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:21,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:44:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648186340] [2024-10-11 13:44:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:21,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:44:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:44:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:44:21,729 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:21,760 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-10-11 13:44:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:44:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 13:44:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:21,762 INFO L225 Difference]: With dead ends: 212 [2024-10-11 13:44:21,762 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 13:44:21,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-11 13:44:21,763 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:21,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 411 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 13:44:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-11 13:44:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-10-11 13:44:21,783 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 131 [2024-10-11 13:44:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:21,784 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-10-11 13:44:21,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-10-11 13:44:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:44:21,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:21,786 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:21,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:44:21,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:21,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash -156042052, now seen corresponding path program 1 times [2024-10-11 13:44:21,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:21,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384508261] [2024-10-11 13:44:21,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:21,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:22,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:22,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384508261] [2024-10-11 13:44:22,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384508261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:22,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:22,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:44:22,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111026742] [2024-10-11 13:44:22,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:22,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:22,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:22,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:22,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:22,391 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:22,718 INFO L93 Difference]: Finished difference Result 301 states and 428 transitions. [2024-10-11 13:44:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:22,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-11 13:44:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:22,721 INFO L225 Difference]: With dead ends: 301 [2024-10-11 13:44:22,721 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 13:44:22,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:44:22,722 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 253 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:22,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 611 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:44:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 13:44:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 109. [2024-10-11 13:44:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-10-11 13:44:22,734 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 131 [2024-10-11 13:44:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:22,735 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-10-11 13:44:22,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-10-11 13:44:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:44:22,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:22,737 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:22,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:44:22,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:22,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:22,738 INFO L85 PathProgramCache]: Analyzing trace with hash -541804589, now seen corresponding path program 1 times [2024-10-11 13:44:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:22,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613270542] [2024-10-11 13:44:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:44:23,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:23,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613270542] [2024-10-11 13:44:23,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613270542] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512443265] [2024-10-11 13:44:23,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:23,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:44:23,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:44:23,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:44:23,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:44:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:24,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:44:24,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:24,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:44:24,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2024-10-11 13:44:24,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 13:44:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 4 proven. 252 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-11 13:44:24,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:24,725 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 20 [2024-10-11 13:44:24,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:44:24,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 36 [2024-10-11 13:44:24,989 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 48 treesize of output 40 [2024-10-11 13:44:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:44:25,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512443265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:44:25,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:44:25,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 19 [2024-10-11 13:44:25,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138210857] [2024-10-11 13:44:25,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:25,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 13:44:25,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:25,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 13:44:25,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:44:25,136 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 19 states, 15 states have (on average 5.0) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-11 13:44:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:26,313 INFO L93 Difference]: Finished difference Result 335 states and 471 transitions. [2024-10-11 13:44:26,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 13:44:26,314 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 5.0) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) Word has length 131 [2024-10-11 13:44:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:26,316 INFO L225 Difference]: With dead ends: 335 [2024-10-11 13:44:26,318 INFO L226 Difference]: Without dead ends: 227 [2024-10-11 13:44:26,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=1393, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 13:44:26,320 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 684 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:26,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1358 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:44:26,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-11 13:44:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 128. [2024-10-11 13:44:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 108 states have internal predecessors, (146), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 180 transitions. [2024-10-11 13:44:26,352 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 180 transitions. Word has length 131 [2024-10-11 13:44:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:26,353 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 180 transitions. [2024-10-11 13:44:26,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 5.0) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-11 13:44:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 180 transitions. [2024-10-11 13:44:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:44:26,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:26,356 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:26,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:44:26,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:44:26,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:26,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:26,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1947724373, now seen corresponding path program 1 times [2024-10-11 13:44:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:26,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203878599] [2024-10-11 13:44:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:44:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203878599] [2024-10-11 13:44:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203878599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413446234] [2024-10-11 13:44:27,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:27,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:44:27,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:44:27,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:44:27,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:44:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:27,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:44:27,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:27,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:44:27,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2024-10-11 13:44:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-10-11 13:44:27,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:28,048 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 48 treesize of output 40 [2024-10-11 13:44:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:44:28,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413446234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:44:28,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:44:28,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2024-10-11 13:44:28,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947139062] [2024-10-11 13:44:28,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:28,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:44:28,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:28,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:44:28,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:44:28,158 INFO L87 Difference]: Start difference. First operand 128 states and 180 transitions. Second operand has 14 states, 10 states have (on average 6.4) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-11 13:44:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:28,721 INFO L93 Difference]: Finished difference Result 281 states and 394 transitions. [2024-10-11 13:44:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:44:28,721 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 6.4) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) Word has length 131 [2024-10-11 13:44:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:28,724 INFO L225 Difference]: With dead ends: 281 [2024-10-11 13:44:28,724 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 13:44:28,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:44:28,728 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 205 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:28,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 732 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:44:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 13:44:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-10-11 13:44:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 121 states have internal predecessors, (157), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:44:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 211 transitions. [2024-10-11 13:44:28,754 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 211 transitions. Word has length 131 [2024-10-11 13:44:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:28,754 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 211 transitions. [2024-10-11 13:44:28,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 6.4) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-11 13:44:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 211 transitions. [2024-10-11 13:44:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:44:28,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:28,756 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:28,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 13:44:28,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:44:28,957 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1499995380, now seen corresponding path program 1 times [2024-10-11 13:44:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920741983] [2024-10-11 13:44:28,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:44:29,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:29,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920741983] [2024-10-11 13:44:29,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920741983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:29,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184573516] [2024-10-11 13:44:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:29,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:44:29,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:44:29,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:44:29,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 13:44:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:30,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:44:30,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:30,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:44:30,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2024-10-11 13:44:30,457 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 11 treesize of output 7 [2024-10-11 13:44:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-11 13:44:30,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:30,703 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 48 treesize of output 40 [2024-10-11 13:44:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:44:30,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184573516] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:44:30,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:44:30,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2024-10-11 13:44:30,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546506311] [2024-10-11 13:44:30,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:30,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 13:44:30,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:30,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 13:44:30,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:44:30,810 INFO L87 Difference]: Start difference. First operand 151 states and 211 transitions. Second operand has 21 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 5 states have call successors, (35) [2024-10-11 13:44:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:31,718 INFO L93 Difference]: Finished difference Result 382 states and 526 transitions. [2024-10-11 13:44:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 13:44:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 5 states have call successors, (35) Word has length 131 [2024-10-11 13:44:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:31,720 INFO L225 Difference]: With dead ends: 382 [2024-10-11 13:44:31,720 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 13:44:31,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 283 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:44:31,722 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 873 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:31,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1483 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:44:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 13:44:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2024-10-11 13:44:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 188 states have (on average 1.2925531914893618) internal successors, (243), 190 states have internal predecessors, (243), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:44:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 331 transitions. [2024-10-11 13:44:31,750 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 331 transitions. Word has length 131 [2024-10-11 13:44:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:31,751 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 331 transitions. [2024-10-11 13:44:31,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 5 states have call successors, (35) [2024-10-11 13:44:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 331 transitions. [2024-10-11 13:44:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:44:31,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:31,753 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:31,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:31,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:44:31,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:31,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash -621274919, now seen corresponding path program 1 times [2024-10-11 13:44:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:31,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835898286] [2024-10-11 13:44:31,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835898286] [2024-10-11 13:44:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835898286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:44:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312019041] [2024-10-11 13:44:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:32,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:32,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:32,250 INFO L87 Difference]: Start difference. First operand 239 states and 331 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:32,391 INFO L93 Difference]: Finished difference Result 681 states and 939 transitions. [2024-10-11 13:44:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:44:32,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-11 13:44:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:32,398 INFO L225 Difference]: With dead ends: 681 [2024-10-11 13:44:32,398 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 13:44:32,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 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-11 13:44:32,400 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 140 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:32,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 994 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 13:44:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 247. [2024-10-11 13:44:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 196 states have (on average 1.2908163265306123) internal successors, (253), 198 states have internal predecessors, (253), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:44:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 341 transitions. [2024-10-11 13:44:32,441 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 341 transitions. Word has length 132 [2024-10-11 13:44:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:32,441 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 341 transitions. [2024-10-11 13:44:32,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 341 transitions. [2024-10-11 13:44:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:44:32,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:32,443 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:44:32,443 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -646180905, now seen corresponding path program 1 times [2024-10-11 13:44:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693276983] [2024-10-11 13:44:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693276983] [2024-10-11 13:44:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693276983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:32,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:44:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832293922] [2024-10-11 13:44:32,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:32,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:32,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:32,821 INFO L87 Difference]: Start difference. First operand 247 states and 341 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:32,969 INFO L93 Difference]: Finished difference Result 471 states and 649 transitions. [2024-10-11 13:44:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:32,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-11 13:44:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:32,972 INFO L225 Difference]: With dead ends: 471 [2024-10-11 13:44:32,972 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 13:44:32,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:44:32,973 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 224 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:32,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 356 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 13:44:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-10-11 13:44:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 192 states have (on average 1.2864583333333333) internal successors, (247), 194 states have internal predecessors, (247), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:44:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 335 transitions. [2024-10-11 13:44:33,003 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 335 transitions. Word has length 132 [2024-10-11 13:44:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:33,005 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 335 transitions. [2024-10-11 13:44:33,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 335 transitions. [2024-10-11 13:44:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:44:33,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:33,007 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:33,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:44:33,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:33,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2054905927, now seen corresponding path program 1 times [2024-10-11 13:44:33,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:33,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841033336] [2024-10-11 13:44:33,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841033336] [2024-10-11 13:44:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841033336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:33,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:44:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735337916] [2024-10-11 13:44:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:33,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:44:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:33,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:44:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:44:33,193 INFO L87 Difference]: Start difference. First operand 243 states and 335 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:33,359 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2024-10-11 13:44:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:44:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:44:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:33,362 INFO L225 Difference]: With dead ends: 588 [2024-10-11 13:44:33,362 INFO L226 Difference]: Without dead ends: 366 [2024-10-11 13:44:33,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-11 13:44:33,363 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 113 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:33,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 798 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-11 13:44:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 170. [2024-10-11 13:44:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 129 states have (on average 1.2403100775193798) internal successors, (160), 130 states have internal predecessors, (160), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:44:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 228 transitions. [2024-10-11 13:44:33,409 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 228 transitions. Word has length 133 [2024-10-11 13:44:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:33,410 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 228 transitions. [2024-10-11 13:44:33,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 228 transitions. [2024-10-11 13:44:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:44:33,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:33,412 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:33,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:44:33,412 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:33,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1503991326, now seen corresponding path program 1 times [2024-10-11 13:44:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613976143] [2024-10-11 13:44:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:34,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613976143] [2024-10-11 13:44:34,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613976143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:34,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:34,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:44:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994400527] [2024-10-11 13:44:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:34,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:34,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:34,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:34,081 INFO L87 Difference]: Start difference. First operand 170 states and 228 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:34,241 INFO L93 Difference]: Finished difference Result 361 states and 483 transitions. [2024-10-11 13:44:34,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:34,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-11 13:44:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:34,245 INFO L225 Difference]: With dead ends: 361 [2024-10-11 13:44:34,245 INFO L226 Difference]: Without dead ends: 243 [2024-10-11 13:44:34,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:44:34,246 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 73 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:34,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 711 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-11 13:44:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2024-10-11 13:44:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.2552083333333333) internal successors, (241), 194 states have internal predecessors, (241), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:44:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 321 transitions. [2024-10-11 13:44:34,275 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 321 transitions. Word has length 134 [2024-10-11 13:44:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:34,275 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 321 transitions. [2024-10-11 13:44:34,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 321 transitions. [2024-10-11 13:44:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:44:34,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:34,276 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:34,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:44:34,277 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:34,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1230609614, now seen corresponding path program 1 times [2024-10-11 13:44:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654814998] [2024-10-11 13:44:34,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:34,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654814998] [2024-10-11 13:44:34,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654814998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:34,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:44:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021099710] [2024-10-11 13:44:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:34,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:44:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:44:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:44:34,454 INFO L87 Difference]: Start difference. First operand 240 states and 321 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:34,631 INFO L93 Difference]: Finished difference Result 567 states and 759 transitions. [2024-10-11 13:44:34,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:44:34,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-11 13:44:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:34,635 INFO L225 Difference]: With dead ends: 567 [2024-10-11 13:44:34,635 INFO L226 Difference]: Without dead ends: 379 [2024-10-11 13:44:34,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-11 13:44:34,636 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 108 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:34,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 508 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-11 13:44:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 240. [2024-10-11 13:44:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.2447916666666667) internal successors, (239), 194 states have internal predecessors, (239), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:44:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 319 transitions. [2024-10-11 13:44:34,682 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 319 transitions. Word has length 134 [2024-10-11 13:44:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:34,683 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 319 transitions. [2024-10-11 13:44:34,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 319 transitions. [2024-10-11 13:44:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:44:34,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:34,684 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:34,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:44:34,685 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:34,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:34,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2106226912, now seen corresponding path program 1 times [2024-10-11 13:44:34,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:34,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81875989] [2024-10-11 13:44:34,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:34,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:35,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81875989] [2024-10-11 13:44:35,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81875989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:35,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:35,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:44:35,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538478814] [2024-10-11 13:44:35,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:35,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:35,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:35,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:35,045 INFO L87 Difference]: Start difference. First operand 240 states and 319 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:35,195 INFO L93 Difference]: Finished difference Result 428 states and 569 transitions. [2024-10-11 13:44:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:35,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:44:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:35,198 INFO L225 Difference]: With dead ends: 428 [2024-10-11 13:44:35,198 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 13:44:35,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:44:35,199 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 131 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:35,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 353 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 13:44:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-10-11 13:44:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.234375) internal successors, (237), 194 states have internal predecessors, (237), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:44:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2024-10-11 13:44:35,231 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 135 [2024-10-11 13:44:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:35,231 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2024-10-11 13:44:35,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2024-10-11 13:44:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:44:35,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:35,233 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:35,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:44:35,233 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:35,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1085158558, now seen corresponding path program 1 times [2024-10-11 13:44:35,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:35,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126973117] [2024-10-11 13:44:35,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:35,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:35,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126973117] [2024-10-11 13:44:35,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126973117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:35,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:35,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:44:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954498150] [2024-10-11 13:44:35,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:35,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:44:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:35,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:44:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:44:35,930 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:36,125 INFO L93 Difference]: Finished difference Result 517 states and 681 transitions. [2024-10-11 13:44:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:44:36,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:44:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:36,128 INFO L225 Difference]: With dead ends: 517 [2024-10-11 13:44:36,128 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 13:44:36,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:44:36,130 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 46 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:36,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 991 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 13:44:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 250. [2024-10-11 13:44:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 202 states have (on average 1.2227722772277227) internal successors, (247), 204 states have internal predecessors, (247), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:44:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 327 transitions. [2024-10-11 13:44:36,163 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 327 transitions. Word has length 135 [2024-10-11 13:44:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:36,163 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 327 transitions. [2024-10-11 13:44:36,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 327 transitions. [2024-10-11 13:44:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:44:36,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:36,165 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:36,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:44:36,165 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:36,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1902807008, now seen corresponding path program 1 times [2024-10-11 13:44:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890709272] [2024-10-11 13:44:36,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890709272] [2024-10-11 13:44:36,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890709272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:36,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:36,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:44:36,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926121968] [2024-10-11 13:44:36,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:36,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:36,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:36,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:36,548 INFO L87 Difference]: Start difference. First operand 250 states and 327 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:36,700 INFO L93 Difference]: Finished difference Result 432 states and 567 transitions. [2024-10-11 13:44:36,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:36,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:44:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:36,702 INFO L225 Difference]: With dead ends: 432 [2024-10-11 13:44:36,702 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 13:44:36,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:44:36,703 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 133 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:36,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 347 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 13:44:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-10-11 13:44:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 186 states have (on average 1.2204301075268817) internal successors, (227), 188 states have internal predecessors, (227), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:44:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 307 transitions. [2024-10-11 13:44:36,734 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 307 transitions. Word has length 135 [2024-10-11 13:44:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:36,734 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 307 transitions. [2024-10-11 13:44:36,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 307 transitions. [2024-10-11 13:44:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:44:36,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:36,736 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:36,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:44:36,736 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash 313186233, now seen corresponding path program 1 times [2024-10-11 13:44:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142219213] [2024-10-11 13:44:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:37,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:37,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142219213] [2024-10-11 13:44:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142219213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:37,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:37,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:44:37,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69650207] [2024-10-11 13:44:37,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:37,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:37,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:37,016 INFO L87 Difference]: Start difference. First operand 234 states and 307 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:37,313 INFO L93 Difference]: Finished difference Result 633 states and 831 transitions. [2024-10-11 13:44:37,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:37,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-11 13:44:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:37,317 INFO L225 Difference]: With dead ends: 633 [2024-10-11 13:44:37,317 INFO L226 Difference]: Without dead ends: 451 [2024-10-11 13:44:37,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:44:37,318 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 210 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:37,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 962 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:44:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-11 13:44:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 353. [2024-10-11 13:44:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 285 states have (on average 1.2350877192982457) internal successors, (352), 287 states have internal predecessors, (352), 57 states have call successors, (57), 10 states have call predecessors, (57), 10 states have return successors, (57), 55 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-11 13:44:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 466 transitions. [2024-10-11 13:44:37,375 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 466 transitions. Word has length 137 [2024-10-11 13:44:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:37,375 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 466 transitions. [2024-10-11 13:44:37,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 466 transitions. [2024-10-11 13:44:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 13:44:37,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:37,376 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:44:37,377 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1531003606, now seen corresponding path program 1 times [2024-10-11 13:44:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:37,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258367785] [2024-10-11 13:44:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:44:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:44:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:44:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:44:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:44:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:44:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:44:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:44:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:44:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:44:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:44:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:44:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:44:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:44:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:44:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:44:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:44:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:44:37,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:44:37,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258367785] [2024-10-11 13:44:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258367785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:37,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:44:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91068562] [2024-10-11 13:44:37,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:37,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:44:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:44:37,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:44:37,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:44:37,626 INFO L87 Difference]: Start difference. First operand 353 states and 466 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:37,717 INFO L93 Difference]: Finished difference Result 369 states and 482 transitions. [2024-10-11 13:44:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:44:37,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-11 13:44:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:37,720 INFO L225 Difference]: With dead ends: 369 [2024-10-11 13:44:37,720 INFO L226 Difference]: Without dead ends: 367 [2024-10-11 13:44:37,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:44:37,721 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 77 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:37,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 507 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-11 13:44:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-10-11 13:44:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 297 states have (on average 1.2255892255892256) internal successors, (364), 299 states have internal predecessors, (364), 57 states have call successors, (57), 12 states have call predecessors, (57), 12 states have return successors, (57), 55 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-11 13:44:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 478 transitions. [2024-10-11 13:44:37,768 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 478 transitions. Word has length 138 [2024-10-11 13:44:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:37,769 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 478 transitions. [2024-10-11 13:44:37,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:44:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 478 transitions. [2024-10-11 13:44:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 13:44:37,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:37,770 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:37,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:44:37,770 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:37,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:37,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1531063188, now seen corresponding path program 1 times [2024-10-11 13:44:37,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:44:37,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300817815] [2024-10-11 13:44:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:44:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:44:37,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:44:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:44:38,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:44:38,067 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:44:38,068 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:44:38,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 13:44:38,074 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] [2024-10-11 13:44:38,271 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:44:38,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:44:38 BoogieIcfgContainer [2024-10-11 13:44:38,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:44:38,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:44:38,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:44:38,275 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:44:38,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:19" (3/4) ... [2024-10-11 13:44:38,277 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:44:38,278 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:44:38,279 INFO L158 Benchmark]: Toolchain (without parser) took 20224.54ms. Allocated memory was 146.8MB in the beginning and 497.0MB in the end (delta: 350.2MB). Free memory was 109.3MB in the beginning and 416.9MB in the end (delta: -307.6MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2024-10-11 13:44:38,280 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory was 82.3MB in the beginning and 82.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:44:38,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.78ms. Allocated memory is still 146.8MB. Free memory was 108.9MB in the beginning and 93.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:44:38,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.06ms. Allocated memory is still 146.8MB. Free memory was 93.4MB in the beginning and 90.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:44:38,280 INFO L158 Benchmark]: Boogie Preprocessor took 85.12ms. Allocated memory is still 146.8MB. Free memory was 90.0MB in the beginning and 84.6MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:44:38,283 INFO L158 Benchmark]: RCFGBuilder took 888.08ms. Allocated memory is still 146.8MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 13:44:38,283 INFO L158 Benchmark]: TraceAbstraction took 18796.29ms. Allocated memory was 146.8MB in the beginning and 497.0MB in the end (delta: 350.2MB). Free memory was 81.9MB in the beginning and 416.9MB in the end (delta: -335.0MB). Peak memory consumption was 270.3MB. Max. memory is 16.1GB. [2024-10-11 13:44:38,284 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 497.0MB. Free memory is still 416.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:44:38,285 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 109.1MB. Free memory was 82.3MB in the beginning and 82.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.78ms. Allocated memory is still 146.8MB. Free memory was 108.9MB in the beginning and 93.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.06ms. Allocated memory is still 146.8MB. Free memory was 93.4MB in the beginning and 90.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.12ms. Allocated memory is still 146.8MB. Free memory was 90.0MB in the beginning and 84.6MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 888.08ms. Allocated memory is still 146.8MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18796.29ms. Allocated memory was 146.8MB in the beginning and 497.0MB in the end (delta: 350.2MB). Free memory was 81.9MB in the beginning and 416.9MB in the end (delta: -335.0MB). Peak memory consumption was 270.3MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 497.0MB. Free memory is still 416.9MB. 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] signed short int var_1_1 = 16; [L22] signed short int var_1_1 = 16; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_7 = 32; [L24] signed short int var_1_7 = 32; [L25] signed short int* var_1_7_Pointer = &(var_1_7); [L26] signed short int var_1_8 = 20113; [L26] signed short int var_1_8 = 20113; [L27] signed short int* var_1_8_Pointer = &(var_1_8); [L28] signed short int var_1_9 = 100; [L28] signed short int var_1_9 = 100; [L29] signed short int* var_1_9_Pointer = &(var_1_9); [L30] signed char var_1_10 = 100; [L30] signed char var_1_10 = 100; [L31] signed char* var_1_10_Pointer = &(var_1_10); [L32] signed char var_1_11 = -1; [L32] signed char var_1_11 = -1; [L33] signed char* var_1_11_Pointer = &(var_1_11); [L34] signed char var_1_12 = 16; [L34] signed char var_1_12 = 16; [L35] signed char* var_1_12_Pointer = &(var_1_12); [L36] unsigned char var_1_13 = 1; [L36] unsigned char var_1_13 = 1; [L37] unsigned char* var_1_13_Pointer = &(var_1_13); [L38] unsigned char var_1_15 = 0; [L38] unsigned char var_1_15 = 0; [L39] unsigned char* var_1_15_Pointer = &(var_1_15); [L40] unsigned char var_1_16 = 1; [L40] unsigned char var_1_16 = 1; [L41] unsigned char* var_1_16_Pointer = &(var_1_16); [L42] unsigned short int var_1_18 = 10; [L42] unsigned short int var_1_18 = 10; [L43] unsigned short int* var_1_18_Pointer = &(var_1_18); [L44] unsigned short int var_1_19 = 256; [L44] unsigned short int var_1_19 = 256; [L45] unsigned short int* var_1_19_Pointer = &(var_1_19); [L46] float var_1_20 = 32.5; [L46] float var_1_20 = 32.5; [L47] float* var_1_20_Pointer = &(var_1_20); [L48] float var_1_21 = 127.4; [L48] float var_1_21 = 127.4; [L49] float* var_1_21_Pointer = &(var_1_21); [L50] signed short int var_1_22 = 128; [L50] signed short int var_1_22 = 128; [L51] signed short int* var_1_22_Pointer = &(var_1_22); [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] FCALL updateLastVariables() [L123] CALL updateVariables() [L85] var_1_7 = __VERIFIER_nondet_short() [L86] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] var_1_8 = __VERIFIER_nondet_short() [L89] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] var_1_9 = __VERIFIER_nondet_short() [L92] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L94] var_1_11 = __VERIFIER_nondet_char() [L95] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L95] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L95] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] var_1_12 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L98] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L98] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L100] var_1_15 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L103] var_1_16 = __VERIFIER_nondet_uchar() [L104] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L104] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L104] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L106] var_1_19 = __VERIFIER_nondet_ushort() [L107] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L109] var_1_21 = __VERIFIER_nondet_float() [L110] EXPR \read(var_1_21) [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F [L110] EXPR \read(var_1_21) [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L123] RET updateVariables() [L124] CALL step() [L55] EXPR \read(*var_1_19_Pointer) [L55] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L56] EXPR \read(*var_1_21_Pointer) [L56] (*(var_1_20_Pointer)) = (*(var_1_21_Pointer)) [L57] EXPR \read(*var_1_12_Pointer) [L57] (*(var_1_22_Pointer)) = (*(var_1_12_Pointer)) [L58] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L58] COND TRUE 127.5f > (*(var_1_20_Pointer)) [L59] EXPR \read(*var_1_15_Pointer) [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) [L59] EXPR \read(*var_1_16_Pointer) [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] (*(var_1_13_Pointer)) = ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))) [L63] EXPR \read(*var_1_18_Pointer) [L63] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L63] COND TRUE (*(var_1_18_Pointer)) == (*(var_1_7_Pointer)) [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_12_Pointer) [L64] (*(var_1_10_Pointer)) = ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)) [L72] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L72] COND TRUE (*(var_1_13_Pointer)) [L73] EXPR \read(*var_1_10_Pointer) [L73] EXPR \read(*var_1_22_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] COND FALSE !((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) [L80] (*(var_1_1_Pointer)) = 8 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1 [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_22_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8)) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR ((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1) [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_11_Pointer) [L115] EXPR \read(*var_1_12_Pointer) [L115] EXPR ((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) [L115] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))) [L115] EXPR \read(*var_1_13_Pointer) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR \read(*var_1_19_Pointer) [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR \read(*var_1_21_Pointer) [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115-L116] return ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 20, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3290 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3273 mSDsluCounter, 12488 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9389 mSDsCounter, 484 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2991 IncrementalHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 484 mSolverCounterUnsat, 3099 mSDtfsCounter, 2991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1629 GetRequests, 1452 SyntacticMatches, 7 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=19, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 937 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 3051 NumberOfCodeBlocks, 3051 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3281 ConstructedInterpolants, 0 QuantifiedInterpolants, 12898 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1807 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 12690/13600 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-11 13:44:38,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:44:40,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:44:40,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:44:40,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:44:40,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:44:40,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:44:40,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:44:40,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:44:40,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:44:40,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:44:40,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:44:40,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:44:40,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:44:40,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:44:40,747 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:44:40,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:44:40,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:44:40,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:44:40,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:44:40,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:44:40,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:44:40,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:44:40,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:44:40,755 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:44:40,755 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:44:40,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:44:40,755 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:44:40,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:44:40,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:44:40,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:44:40,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:44:40,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:44:40,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:44:40,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:44:40,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:44:40,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:44:40,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:44:40,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:44:40,764 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:44:40,764 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:40,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:44:40,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:44:40,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:44:40,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:44:40,768 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:44:40,768 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-clean/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-clean/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 -> 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b [2024-10-11 13:44:41,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:44:41,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:44:41,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:44:41,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:44:41,088 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:44:41,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-11 13:44:42,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:44:42,988 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:44:42,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-11 13:44:43,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2601429cf/5b61a34920b446fca5c101659d283bb6/FLAG5c62ae56b [2024-10-11 13:44:43,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2601429cf/5b61a34920b446fca5c101659d283bb6 [2024-10-11 13:44:43,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:44:43,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:44:43,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:44:43,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:44:43,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:44:43,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af273cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43, skipping insertion in model container [2024-10-11 13:44:43,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:44:43,577 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-97.i[916,929] [2024-10-11 13:44:43,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:44:43,653 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:44:43,669 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-97.i[916,929] [2024-10-11 13:44:43,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:44:43,724 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:44:43,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43 WrapperNode [2024-10-11 13:44:43,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:44:43,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:44:43,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:44:43,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:44:43,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,784 INFO L138 Inliner]: procedures = 33, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2024-10-11 13:44:43,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:44:43,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:44:43,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:44:43,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:44:43,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,856 INFO L175 MemorySlicer]: Split 116 memory accesses to 16 slices as follows [2, 7, 8, 6, 6, 7, 8, 10, 11, 8, 6, 7, 6, 9, 8, 7]. 9 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 19 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-10-11 13:44:43,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:44:43,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:44:43,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:44:43,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:44:43,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (1/1) ... [2024-10-11 13:44:43,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:44:43,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:44:43,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:44:43,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:44:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:44:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:44:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:44:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:44:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:44:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:44:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:44:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:44:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:44:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:44:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:44:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-11 13:44:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-11 13:44:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-11 13:44:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-11 13:44:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-11 13:44:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-11 13:44:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:44:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:44:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:44:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:44:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:44:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:44:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:44:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:44:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:44:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:44:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-11 13:44:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-11 13:44:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-11 13:44:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-11 13:44:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-11 13:44:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-11 13:44:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:44:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:44:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:44:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:44:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:44:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:44:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:44:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:44:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:44:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:44:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:44:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:44:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:44:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:44:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:44:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:44:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:44:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-11 13:44:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-11 13:44:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-11 13:44:44,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-11 13:44:44,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-11 13:44:44,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-11 13:44:44,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:44:44,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:44:44,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:44:44,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:44:44,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:44:44,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:44:44,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:44:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:44:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:44:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:44:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-11 13:44:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-11 13:44:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-11 13:44:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-11 13:44:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-11 13:44:44,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-11 13:44:44,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:44:44,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:44:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:44:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:44:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:44:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:44:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:44:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:44:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:44:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:44:44,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:44:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-11 13:44:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-11 13:44:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:44:44,055 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:44:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:44:44,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:44:44,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:44:44,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-11 13:44:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-11 13:44:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-11 13:44:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-11 13:44:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-11 13:44:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-11 13:44:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:44:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:44:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:44:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:44:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:44:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:44:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:44:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:44:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:44:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:44:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-11 13:44:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-11 13:44:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-11 13:44:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-11 13:44:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-11 13:44:44,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-11 13:44:44,325 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:44:44,327 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:44:44,948 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-10-11 13:44:44,949 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:44:45,010 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:44:45,010 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:44:45,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:45 BoogieIcfgContainer [2024-10-11 13:44:45,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:44:45,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:44:45,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:44:45,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:44:45,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:44:43" (1/3) ... [2024-10-11 13:44:45,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513452e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:45, skipping insertion in model container [2024-10-11 13:44:45,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:43" (2/3) ... [2024-10-11 13:44:45,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513452e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:45, skipping insertion in model container [2024-10-11 13:44:45,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:45" (3/3) ... [2024-10-11 13:44:45,021 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-97.i [2024-10-11 13:44:45,038 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:44:45,038 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:44:45,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:44:45,128 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;@5a1b3427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:44:45,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:44:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:44:45,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:45,146 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:45,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:45,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash -61911549, now seen corresponding path program 1 times [2024-10-11 13:44:45,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822752913] [2024-10-11 13:44:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:45,168 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-11 13:44:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:45,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:44:45,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:44:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:45,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:44:45,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-11 13:44:45,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:45,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:45,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822752913] [2024-10-11 13:44:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822752913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:45,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:45,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:44:45,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518821605] [2024-10-11 13:44:45,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:45,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:44:45,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:45,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:44:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:44:45,710 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:44:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:45,779 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2024-10-11 13:44:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:44:45,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-11 13:44:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:45,793 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:44:45,794 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:44:45,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-11 13:44:45,804 INFO L432 NwaCegarLoop]: 129 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, 129 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-11 13:44:45,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:44:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:44:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:44:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-11 13:44:45,867 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 129 [2024-10-11 13:44:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:45,868 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-11 13:44:45,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:44:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-11 13:44:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:44:45,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:45,872 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:45,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:44:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:44:46,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:46,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash 94664801, now seen corresponding path program 1 times [2024-10-11 13:44:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087405204] [2024-10-11 13:44:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:46,075 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-11 13:44:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:46,078 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:44:46,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:44:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:46,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:44:46,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:47,279 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 42 treesize of output 26 [2024-10-11 13:44:47,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:44:47,353 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-11 13:44:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-11 13:44:47,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:47,854 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:44:47,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:44:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 13:44:48,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:48,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087405204] [2024-10-11 13:44:48,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087405204] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:44:48,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:48,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-11 13:44:48,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365643470] [2024-10-11 13:44:48,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:48,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 13:44:48,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 13:44:48,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:44:48,038 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 24 states, 20 states have (on average 4.05) internal successors, (81), 22 states have internal predecessors, (81), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:44:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:49,815 INFO L93 Difference]: Finished difference Result 293 states and 415 transitions. [2024-10-11 13:44:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 13:44:49,815 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.05) internal successors, (81), 22 states have internal predecessors, (81), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 129 [2024-10-11 13:44:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:49,818 INFO L225 Difference]: With dead ends: 293 [2024-10-11 13:44:49,818 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 13:44:49,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 13:44:49,821 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 750 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:49,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1496 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:44:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 13:44:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 106. [2024-10-11 13:44:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:44:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 149 transitions. [2024-10-11 13:44:49,847 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 149 transitions. Word has length 129 [2024-10-11 13:44:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:49,851 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 149 transitions. [2024-10-11 13:44:49,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.05) internal successors, (81), 22 states have internal predecessors, (81), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:44:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 149 transitions. [2024-10-11 13:44:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:44:49,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:49,854 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:49,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:50,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:44:50,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 517366627, now seen corresponding path program 1 times [2024-10-11 13:44:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785427495] [2024-10-11 13:44:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:50,057 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-11 13:44:50,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:50,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:44:50,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:44:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:50,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 13:44:50,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:51,003 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 42 treesize of output 26 [2024-10-11 13:44:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-11 13:44:51,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:51,336 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:44:51,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:44:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 13:44:51,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785427495] [2024-10-11 13:44:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785427495] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:44:51,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-10-11 13:44:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697665323] [2024-10-11 13:44:51,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:51,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 13:44:51,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 13:44:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:44:51,485 INFO L87 Difference]: Start difference. First operand 106 states and 149 transitions. Second operand has 20 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:44:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:52,243 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2024-10-11 13:44:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 13:44:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 129 [2024-10-11 13:44:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:52,246 INFO L225 Difference]: With dead ends: 241 [2024-10-11 13:44:52,246 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 13:44:52,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:44:52,248 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 347 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:52,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 808 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:44:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 13:44:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-10-11 13:44:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.29) internal successors, (129), 101 states have internal predecessors, (129), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:44:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 183 transitions. [2024-10-11 13:44:52,267 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 183 transitions. Word has length 129 [2024-10-11 13:44:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:52,268 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 183 transitions. [2024-10-11 13:44:52,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:44:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2024-10-11 13:44:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:44:52,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:52,270 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:52,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:44:52,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 13:44:52,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:52,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1872436698, now seen corresponding path program 1 times [2024-10-11 13:44:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994366211] [2024-10-11 13:44:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:52,473 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-11 13:44:52,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:52,475 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 13:44:52,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:44:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:52,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:44:52,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:53,280 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 42 treesize of output 26 [2024-10-11 13:44:53,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:44:53,319 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-11 13:44:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-11 13:44:53,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:53,703 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:44:53,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:44:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 13:44:53,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:53,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994366211] [2024-10-11 13:44:53,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994366211] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:44:53,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-11 13:44:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544898969] [2024-10-11 13:44:53,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:53,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 13:44:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:53,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 13:44:53,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:44:53,820 INFO L87 Difference]: Start difference. First operand 133 states and 183 transitions. Second operand has 24 states, 20 states have (on average 4.15) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:44:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:55,460 INFO L93 Difference]: Finished difference Result 350 states and 473 transitions. [2024-10-11 13:44:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 13:44:55,461 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.15) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 129 [2024-10-11 13:44:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:55,463 INFO L225 Difference]: With dead ends: 350 [2024-10-11 13:44:55,463 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 13:44:55,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 13:44:55,465 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 599 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:55,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1618 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:44:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 13:44:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 225. [2024-10-11 13:44:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 172 states have internal predecessors, (218), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:44:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 306 transitions. [2024-10-11 13:44:55,505 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 306 transitions. Word has length 129 [2024-10-11 13:44:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:55,505 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 306 transitions. [2024-10-11 13:44:55,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.15) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:44:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 306 transitions. [2024-10-11 13:44:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:44:55,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:55,508 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:55,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:44:55,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 13:44:55,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:55,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash 472302903, now seen corresponding path program 1 times [2024-10-11 13:44:55,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:55,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747422723] [2024-10-11 13:44:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:55,710 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-11 13:44:55,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:55,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 13:44:55,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:44:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:55,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:44:55,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:56,443 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 42 treesize of output 26 [2024-10-11 13:44:56,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:44:56,489 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-11 13:44:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-11 13:44:56,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:56,819 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:44:56,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:44:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 13:44:56,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:56,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747422723] [2024-10-11 13:44:56,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747422723] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:44:56,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:56,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-11 13:44:56,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389717094] [2024-10-11 13:44:56,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:56,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 13:44:56,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:56,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 13:44:56,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:44:56,969 INFO L87 Difference]: Start difference. First operand 225 states and 306 transitions. Second operand has 24 states, 20 states have (on average 4.25) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:44:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:58,144 INFO L93 Difference]: Finished difference Result 482 states and 640 transitions. [2024-10-11 13:44:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 13:44:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.25) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 130 [2024-10-11 13:44:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:58,147 INFO L225 Difference]: With dead ends: 482 [2024-10-11 13:44:58,147 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 13:44:58,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 13:44:58,150 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 718 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:58,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1291 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:44:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 13:44:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 176. [2024-10-11 13:44:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.251908396946565) internal successors, (164), 132 states have internal predecessors, (164), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:44:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 232 transitions. [2024-10-11 13:44:58,180 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 232 transitions. Word has length 130 [2024-10-11 13:44:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:58,181 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 232 transitions. [2024-10-11 13:44:58,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.25) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:44:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 232 transitions. [2024-10-11 13:44:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:44:58,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:58,183 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:44:58,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:58,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 13:44:58,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:58,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash -251343138, now seen corresponding path program 1 times [2024-10-11 13:44:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:58,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393342272] [2024-10-11 13:44:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:58,385 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-11 13:44:58,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:58,386 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 13:44:58,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:44:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:58,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:44:58,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:59,049 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 42 treesize of output 26 [2024-10-11 13:44:59,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:44:59,093 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-11 13:44:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-11 13:44:59,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:59,443 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:44:59,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:44:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 13:44:59,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393342272] [2024-10-11 13:44:59,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393342272] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:44:59,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:59,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-11 13:44:59,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075898722] [2024-10-11 13:44:59,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:59,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 13:44:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 13:44:59,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:44:59,530 INFO L87 Difference]: Start difference. First operand 176 states and 232 transitions. Second operand has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:00,914 INFO L93 Difference]: Finished difference Result 394 states and 521 transitions. [2024-10-11 13:45:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 13:45:00,916 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 130 [2024-10-11 13:45:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:00,918 INFO L225 Difference]: With dead ends: 394 [2024-10-11 13:45:00,918 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 13:45:00,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 13:45:00,923 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 408 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:00,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1657 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:45:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 13:45:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 166. [2024-10-11 13:45:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 121 states have (on average 1.2231404958677685) internal successors, (148), 122 states have internal predecessors, (148), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:45:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2024-10-11 13:45:00,963 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 130 [2024-10-11 13:45:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:00,964 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2024-10-11 13:45:00,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2024-10-11 13:45:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:45:00,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:00,967 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:00,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 13:45:01,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-11 13:45:01,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:01,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1638600763, now seen corresponding path program 1 times [2024-10-11 13:45:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:01,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746890593] [2024-10-11 13:45:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:01,169 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-11 13:45:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:01,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 13:45:01,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:01,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:45:01,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:01,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:45:01,430 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 37 treesize of output 25 [2024-10-11 13:45:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:01,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:01,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746890593] [2024-10-11 13:45:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746890593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:45:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116059289] [2024-10-11 13:45:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:45:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:01,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:45:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:45:01,451 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:01,602 INFO L93 Difference]: Finished difference Result 381 states and 502 transitions. [2024-10-11 13:45:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:45:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-11 13:45:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:01,604 INFO L225 Difference]: With dead ends: 381 [2024-10-11 13:45:01,604 INFO L226 Difference]: Without dead ends: 275 [2024-10-11 13:45:01,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 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-11 13:45:01,605 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 127 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:01,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1007 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:45:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-11 13:45:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 172. [2024-10-11 13:45:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.220472440944882) internal successors, (155), 128 states have internal predecessors, (155), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:45:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2024-10-11 13:45:01,628 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 223 transitions. Word has length 132 [2024-10-11 13:45:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:01,628 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 223 transitions. [2024-10-11 13:45:01,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 223 transitions. [2024-10-11 13:45:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:45:01,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:01,630 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:01,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 13:45:01,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-11 13:45:01,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2016866472, now seen corresponding path program 1 times [2024-10-11 13:45:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:01,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403711810] [2024-10-11 13:45:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:01,832 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-11 13:45:01,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:01,835 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 13:45:01,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:02,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:45:02,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:02,494 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 42 treesize of output 26 [2024-10-11 13:45:02,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:45:02,527 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-11 13:45:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-11 13:45:02,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:02,825 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:45:02,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:45:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 13:45:02,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:02,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403711810] [2024-10-11 13:45:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403711810] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:45:02,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:45:02,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-11 13:45:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048475444] [2024-10-11 13:45:02,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:45:02,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 13:45:02,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:02,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 13:45:02,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:45:02,949 INFO L87 Difference]: Start difference. First operand 172 states and 223 transitions. Second operand has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:04,010 INFO L93 Difference]: Finished difference Result 402 states and 525 transitions. [2024-10-11 13:45:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 13:45:04,010 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 133 [2024-10-11 13:45:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:04,012 INFO L225 Difference]: With dead ends: 402 [2024-10-11 13:45:04,013 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 13:45:04,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 13:45:04,014 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 542 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:04,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 829 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:45:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 13:45:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 180. [2024-10-11 13:45:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.237037037037037) internal successors, (167), 136 states have internal predecessors, (167), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:45:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2024-10-11 13:45:04,035 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 133 [2024-10-11 13:45:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:04,036 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2024-10-11 13:45:04,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2024-10-11 13:45:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:45:04,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:04,037 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:04,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:04,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-11 13:45:04,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash -22721766, now seen corresponding path program 1 times [2024-10-11 13:45:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802661748] [2024-10-11 13:45:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:04,239 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-11 13:45:04,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:04,240 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-11 13:45:04,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:04,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:45:04,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:04,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:04,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:04,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802661748] [2024-10-11 13:45:04,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802661748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:04,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:04,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:45:04,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522940691] [2024-10-11 13:45:04,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:04,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:45:04,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:04,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:45:04,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:45:04,522 INFO L87 Difference]: Start difference. First operand 180 states and 235 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:04,582 INFO L93 Difference]: Finished difference Result 305 states and 402 transitions. [2024-10-11 13:45:04,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:45:04,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:45:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:04,584 INFO L225 Difference]: With dead ends: 305 [2024-10-11 13:45:04,584 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 13:45:04,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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-11 13:45:04,585 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:04,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:45:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 13:45:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2024-10-11 13:45:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 139 states have (on average 1.2302158273381294) internal successors, (171), 140 states have internal predecessors, (171), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:45:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 239 transitions. [2024-10-11 13:45:04,608 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 239 transitions. Word has length 133 [2024-10-11 13:45:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:04,608 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 239 transitions. [2024-10-11 13:45:04,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 239 transitions. [2024-10-11 13:45:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:45:04,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:04,610 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:04,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:04,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-11 13:45:04,811 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:04,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash -832068392, now seen corresponding path program 1 times [2024-10-11 13:45:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:04,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570441400] [2024-10-11 13:45:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:04,812 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-11 13:45:04,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:04,815 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-11 13:45:04,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:05,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:45:05,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:05,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:05,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:05,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570441400] [2024-10-11 13:45:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570441400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:05,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:05,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:45:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552632020] [2024-10-11 13:45:05,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:05,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:45:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:45:05,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:45:05,107 INFO L87 Difference]: Start difference. First operand 184 states and 239 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:05,174 INFO L93 Difference]: Finished difference Result 311 states and 407 transitions. [2024-10-11 13:45:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:45:05,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:45:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:05,176 INFO L225 Difference]: With dead ends: 311 [2024-10-11 13:45:05,176 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 13:45:05,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 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-11 13:45:05,177 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:05,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 583 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:45:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 13:45:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-10-11 13:45:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 142 states have internal predecessors, (173), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:45:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2024-10-11 13:45:05,197 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 133 [2024-10-11 13:45:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:05,198 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2024-10-11 13:45:05,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2024-10-11 13:45:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:45:05,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:05,199 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:05,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:05,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-11 13:45:05,400 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:05,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:05,400 INFO L85 PathProgramCache]: Analyzing trace with hash -774810090, now seen corresponding path program 1 times [2024-10-11 13:45:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018554080] [2024-10-11 13:45:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:05,401 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-11 13:45:05,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:05,402 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-11 13:45:05,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:05,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:45:05,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:05,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:05,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018554080] [2024-10-11 13:45:05,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018554080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:05,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:05,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:45:05,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279694664] [2024-10-11 13:45:05,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:05,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:45:05,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:45:05,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:45:05,669 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:05,743 INFO L93 Difference]: Finished difference Result 315 states and 411 transitions. [2024-10-11 13:45:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:45:05,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:45:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:05,748 INFO L225 Difference]: With dead ends: 315 [2024-10-11 13:45:05,748 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 13:45:05,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:45:05,749 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:05,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 694 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:45:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 13:45:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2024-10-11 13:45:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.2237762237762237) internal successors, (175), 144 states have internal predecessors, (175), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:45:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2024-10-11 13:45:05,771 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 133 [2024-10-11 13:45:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:05,771 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2024-10-11 13:45:05,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2024-10-11 13:45:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:45:05,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:05,773 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:05,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:05,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-11 13:45:05,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:05,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash -774750508, now seen corresponding path program 1 times [2024-10-11 13:45:05,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:05,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232083257] [2024-10-11 13:45:05,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:05,975 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-11 13:45:05,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:05,977 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-11 13:45:05,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:06,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:45:06,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:06,604 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 37 treesize of output 25 [2024-10-11 13:45:06,607 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 14 treesize of output 10 [2024-10-11 13:45:06,867 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-11 13:45:06,872 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-11 13:45:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 31 proven. 309 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-11 13:45:07,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:08,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:08,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232083257] [2024-10-11 13:45:08,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232083257] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:45:08,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:45:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-11 13:45:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368830117] [2024-10-11 13:45:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:08,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:45:08,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:45:08,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:45:08,356 INFO L87 Difference]: Start difference. First operand 188 states and 243 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:08,645 INFO L93 Difference]: Finished difference Result 414 states and 536 transitions. [2024-10-11 13:45:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:45:08,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-11 13:45:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:08,648 INFO L225 Difference]: With dead ends: 414 [2024-10-11 13:45:08,648 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 13:45:08,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:45:08,649 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 180 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:08,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 553 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:45:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 13:45:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 188. [2024-10-11 13:45:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 144 states have internal predecessors, (174), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:45:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2024-10-11 13:45:08,676 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 133 [2024-10-11 13:45:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:08,677 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2024-10-11 13:45:08,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2024-10-11 13:45:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:45:08,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:08,679 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:08,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:08,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-11 13:45:08,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:08,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 164715940, now seen corresponding path program 1 times [2024-10-11 13:45:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:08,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535706821] [2024-10-11 13:45:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:08,881 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-11 13:45:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:08,884 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-11 13:45:08,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:09,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 13:45:09,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:10,491 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 18 treesize of output 14 [2024-10-11 13:45:10,588 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 28 treesize of output 24 [2024-10-11 13:45:10,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-11 13:45:10,942 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 124 treesize of output 100 [2024-10-11 13:45:10,953 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 73 [2024-10-11 13:45:10,962 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 78 treesize of output 62 [2024-10-11 13:45:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 29 proven. 365 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 13:45:11,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:11,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:11,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535706821] [2024-10-11 13:45:11,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535706821] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:45:11,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:45:11,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [27] total 32 [2024-10-11 13:45:11,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033624148] [2024-10-11 13:45:11,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:11,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:45:11,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:11,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:45:11,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2024-10-11 13:45:11,455 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:11,724 INFO L93 Difference]: Finished difference Result 391 states and 506 transitions. [2024-10-11 13:45:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:45:11,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-11 13:45:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:11,727 INFO L225 Difference]: With dead ends: 391 [2024-10-11 13:45:11,727 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 13:45:11,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 13:45:11,729 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 181 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:11,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 761 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:45:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 13:45:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2024-10-11 13:45:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 208 states have (on average 1.2307692307692308) internal successors, (256), 210 states have internal predecessors, (256), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:45:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 336 transitions. [2024-10-11 13:45:11,760 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 336 transitions. Word has length 134 [2024-10-11 13:45:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:11,760 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 336 transitions. [2024-10-11 13:45:11,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 336 transitions. [2024-10-11 13:45:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:45:11,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:11,763 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:11,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:11,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-11 13:45:11,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:11,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1548816646, now seen corresponding path program 1 times [2024-10-11 13:45:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552200001] [2024-10-11 13:45:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:11,964 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-11 13:45:11,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:11,965 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-11 13:45:11,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:12,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:45:12,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:12,659 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 37 treesize of output 25 [2024-10-11 13:45:12,661 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 14 treesize of output 10 [2024-10-11 13:45:12,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 13:45:12,833 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 31 treesize of output 19 [2024-10-11 13:45:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 31 proven. 309 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-11 13:45:13,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:14,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552200001] [2024-10-11 13:45:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552200001] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:45:14,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:45:14,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-11 13:45:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657333833] [2024-10-11 13:45:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:14,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:45:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:45:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:45:14,282 INFO L87 Difference]: Start difference. First operand 260 states and 336 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:14,502 INFO L93 Difference]: Finished difference Result 599 states and 777 transitions. [2024-10-11 13:45:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:45:14,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-11 13:45:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:14,506 INFO L225 Difference]: With dead ends: 599 [2024-10-11 13:45:14,506 INFO L226 Difference]: Without dead ends: 399 [2024-10-11 13:45:14,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:45:14,508 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 102 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:14,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 483 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:45:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-11 13:45:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 260. [2024-10-11 13:45:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 208 states have (on average 1.2211538461538463) internal successors, (254), 210 states have internal predecessors, (254), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:45:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 334 transitions. [2024-10-11 13:45:14,540 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 334 transitions. Word has length 134 [2024-10-11 13:45:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:14,540 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 334 transitions. [2024-10-11 13:45:14,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 334 transitions. [2024-10-11 13:45:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:45:14,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:14,541 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:14,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:14,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-11 13:45:14,742 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:14,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash 827705615, now seen corresponding path program 1 times [2024-10-11 13:45:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207545480] [2024-10-11 13:45:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:14,744 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-11 13:45:14,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:14,745 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-11 13:45:14,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:45:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:15,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 13:45:15,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:15,060 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 37 treesize of output 33 [2024-10-11 13:45:15,127 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 102 [2024-10-11 13:45:15,132 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 102 treesize of output 90 [2024-10-11 13:45:15,135 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 100 treesize of output 84 [2024-10-11 13:45:15,139 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 78 treesize of output 66 [2024-10-11 13:45:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:15,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:15,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:15,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207545480] [2024-10-11 13:45:15,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207545480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:15,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:15,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:45:15,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280479240] [2024-10-11 13:45:15,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:15,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:45:15,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:15,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:45:15,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:45:15,190 INFO L87 Difference]: Start difference. First operand 260 states and 334 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:15,570 INFO L93 Difference]: Finished difference Result 511 states and 656 transitions. [2024-10-11 13:45:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:45:15,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:45:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:15,574 INFO L225 Difference]: With dead ends: 511 [2024-10-11 13:45:15,574 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 13:45:15,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:45:15,577 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 94 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:15,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1083 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:45:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 13:45:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 265. [2024-10-11 13:45:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 213 states have (on average 1.2206572769953052) internal successors, (260), 215 states have internal predecessors, (260), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:45:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 340 transitions. [2024-10-11 13:45:15,606 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 340 transitions. Word has length 135 [2024-10-11 13:45:15,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:15,607 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 340 transitions. [2024-10-11 13:45:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 340 transitions. [2024-10-11 13:45:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:45:15,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:15,609 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:15,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:45:15,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/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-11 13:45:15,809 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:15,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash -193362739, now seen corresponding path program 1 times [2024-10-11 13:45:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:15,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429549694] [2024-10-11 13:45:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:15,810 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-11 13:45:15,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:15,812 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/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-11 13:45:15,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Waiting until timeout for monitored process [2024-10-11 13:45:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:16,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:45:16,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:16,505 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 42 treesize of output 26 [2024-10-11 13:45:16,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:45:16,542 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-11 13:45:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-11 13:45:16,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:16,862 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:45:16,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:45:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 13:45:16,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:16,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429549694] [2024-10-11 13:45:16,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429549694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:45:16,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:45:16,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-11 13:45:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757931923] [2024-10-11 13:45:16,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:45:16,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 13:45:16,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:16,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 13:45:16,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:45:16,967 INFO L87 Difference]: Start difference. First operand 265 states and 340 transitions. Second operand has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:18,210 INFO L93 Difference]: Finished difference Result 647 states and 828 transitions. [2024-10-11 13:45:18,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 13:45:18,210 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-10-11 13:45:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:18,213 INFO L225 Difference]: With dead ends: 647 [2024-10-11 13:45:18,213 INFO L226 Difference]: Without dead ends: 442 [2024-10-11 13:45:18,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 13:45:18,214 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 850 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:18,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 835 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:45:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-11 13:45:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 273. [2024-10-11 13:45:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 223 states have internal predecessors, (268), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:45:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 348 transitions. [2024-10-11 13:45:18,241 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 348 transitions. Word has length 135 [2024-10-11 13:45:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:18,242 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 348 transitions. [2024-10-11 13:45:18,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 348 transitions. [2024-10-11 13:45:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:45:18,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:18,243 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:18,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Ended with exit code 0 [2024-10-11 13:45:18,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/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-11 13:45:18,444 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:18,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:18,444 INFO L85 PathProgramCache]: Analyzing trace with hash -941276560, now seen corresponding path program 1 times [2024-10-11 13:45:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:18,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351689802] [2024-10-11 13:45:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:18,445 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-11 13:45:18,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:18,446 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/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-11 13:45:18,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (18)] Waiting until timeout for monitored process [2024-10-11 13:45:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:18,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:45:18,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:18,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-11 13:45:18,775 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-11 13:45:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:18,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:18,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:18,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351689802] [2024-10-11 13:45:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351689802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:18,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:18,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:45:18,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516455474] [2024-10-11 13:45:18,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:18,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:45:18,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:18,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:45:18,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:45:18,795 INFO L87 Difference]: Start difference. First operand 273 states and 348 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:22,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:45:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:22,639 INFO L93 Difference]: Finished difference Result 488 states and 622 transitions. [2024-10-11 13:45:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:45:22,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-11 13:45:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:22,641 INFO L225 Difference]: With dead ends: 488 [2024-10-11 13:45:22,641 INFO L226 Difference]: Without dead ends: 275 [2024-10-11 13:45:22,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:45:22,643 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 176 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:22,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 521 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 13:45:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-11 13:45:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2024-10-11 13:45:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.2081447963800904) internal successors, (267), 223 states have internal predecessors, (267), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:45:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 347 transitions. [2024-10-11 13:45:22,676 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 347 transitions. Word has length 135 [2024-10-11 13:45:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:22,676 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 347 transitions. [2024-10-11 13:45:22,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2024-10-11 13:45:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:45:22,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:22,677 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:22,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (18)] Forceful destruction successful, exit code 0 [2024-10-11 13:45:22,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/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-11 13:45:22,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -15573882, now seen corresponding path program 1 times [2024-10-11 13:45:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:22,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169762756] [2024-10-11 13:45:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:22,879 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-11 13:45:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:22,880 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/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-11 13:45:22,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (19)] Waiting until timeout for monitored process [2024-10-11 13:45:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:23,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:45:23,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:23,562 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 42 treesize of output 26 [2024-10-11 13:45:23,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:45:23,595 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-11 13:45:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-11 13:45:23,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:23,939 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:45:23,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:45:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 13:45:24,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169762756] [2024-10-11 13:45:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169762756] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:45:24,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:45:24,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-11 13:45:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107464043] [2024-10-11 13:45:24,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:45:24,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 13:45:24,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:24,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 13:45:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:45:24,022 INFO L87 Difference]: Start difference. First operand 273 states and 347 transitions. Second operand has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:25,402 INFO L93 Difference]: Finished difference Result 651 states and 826 transitions. [2024-10-11 13:45:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 13:45:25,403 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-10-11 13:45:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:25,406 INFO L225 Difference]: With dead ends: 651 [2024-10-11 13:45:25,406 INFO L226 Difference]: Without dead ends: 438 [2024-10-11 13:45:25,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 13:45:25,408 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 437 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:25,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1323 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:45:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-11 13:45:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 269. [2024-10-11 13:45:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 217 states have (on average 1.1981566820276497) internal successors, (260), 219 states have internal predecessors, (260), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:45:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 340 transitions. [2024-10-11 13:45:25,452 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 340 transitions. Word has length 135 [2024-10-11 13:45:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:25,453 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 340 transitions. [2024-10-11 13:45:25,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 340 transitions. [2024-10-11 13:45:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:45:25,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:25,454 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:25,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (19)] Forceful destruction successful, exit code 0 [2024-10-11 13:45:25,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/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-11 13:45:25,655 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:25,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash -218993786, now seen corresponding path program 1 times [2024-10-11 13:45:25,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:25,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825785938] [2024-10-11 13:45:25,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:25,656 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-11 13:45:25,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:25,657 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/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-11 13:45:25,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (20)] Waiting until timeout for monitored process [2024-10-11 13:45:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:25,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:45:25,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:26,391 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 42 treesize of output 26 [2024-10-11 13:45:26,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:45:26,438 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-11 13:45:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-11 13:45:26,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:26,744 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:45:26,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:45:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-11 13:45:26,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:26,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825785938] [2024-10-11 13:45:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825785938] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:45:26,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:45:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-11 13:45:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321184524] [2024-10-11 13:45:26,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:45:26,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 13:45:26,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:26,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 13:45:26,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:45:26,830 INFO L87 Difference]: Start difference. First operand 269 states and 340 transitions. Second operand has 24 states, 20 states have (on average 4.75) internal successors, (95), 22 states have internal predecessors, (95), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:28,401 INFO L93 Difference]: Finished difference Result 641 states and 810 transitions. [2024-10-11 13:45:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 13:45:28,402 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.75) internal successors, (95), 22 states have internal predecessors, (95), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-10-11 13:45:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:28,404 INFO L225 Difference]: With dead ends: 641 [2024-10-11 13:45:28,404 INFO L226 Difference]: Without dead ends: 432 [2024-10-11 13:45:28,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 13:45:28,406 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 385 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:28,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1612 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:45:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-11 13:45:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 243. [2024-10-11 13:45:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 191 states have (on average 1.1832460732984293) internal successors, (226), 193 states have internal predecessors, (226), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:45:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 306 transitions. [2024-10-11 13:45:28,441 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 306 transitions. Word has length 135 [2024-10-11 13:45:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:28,441 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 306 transitions. [2024-10-11 13:45:28,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.75) internal successors, (95), 22 states have internal predecessors, (95), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-11 13:45:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 306 transitions. [2024-10-11 13:45:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:45:28,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:28,443 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:28,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (20)] Ended with exit code 0 [2024-10-11 13:45:28,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/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-11 13:45:28,644 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:28,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 730338792, now seen corresponding path program 1 times [2024-10-11 13:45:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120328280] [2024-10-11 13:45:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:28,645 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-11 13:45:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:28,648 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/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-11 13:45:28,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (21)] Waiting until timeout for monitored process [2024-10-11 13:45:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:28,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:45:28,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:28,961 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-11 13:45:28,963 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-11 13:45:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:45:28,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:28,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120328280] [2024-10-11 13:45:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120328280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:28,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:28,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:45:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013699802] [2024-10-11 13:45:28,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:28,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:45:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:45:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:45:28,984 INFO L87 Difference]: Start difference. First operand 243 states and 306 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:29,252 INFO L93 Difference]: Finished difference Result 419 states and 526 transitions. [2024-10-11 13:45:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:45:29,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-11 13:45:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:29,254 INFO L225 Difference]: With dead ends: 419 [2024-10-11 13:45:29,255 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 13:45:29,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:45:29,255 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 189 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:29,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 419 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:45:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 13:45:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2024-10-11 13:45:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 182 states have (on average 1.1703296703296704) internal successors, (213), 184 states have internal predecessors, (213), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:45:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 293 transitions. [2024-10-11 13:45:29,288 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 293 transitions. Word has length 136 [2024-10-11 13:45:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:29,288 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 293 transitions. [2024-10-11 13:45:29,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:45:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 293 transitions. [2024-10-11 13:45:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:45:29,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:29,289 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:45:29,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (21)] Ended with exit code 0 [2024-10-11 13:45:29,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/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-11 13:45:29,490 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:29,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash 901676483, now seen corresponding path program 1 times [2024-10-11 13:45:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:29,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165629528] [2024-10-11 13:45:29,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:29,491 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-11 13:45:29,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:29,494 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/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-11 13:45:29,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (22)] Waiting until timeout for monitored process [2024-10-11 13:45:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:29,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:45:29,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:29,789 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 37 treesize of output 33 [2024-10-11 13:45:29,818 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 102 [2024-10-11 13:45:29,820 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 102 treesize of output 90 [2024-10-11 13:45:29,822 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 90 treesize of output 78 [2024-10-11 13:45:29,824 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 78 treesize of output 66