/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:47:08,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:47:08,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 01:47:08,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:47:08,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:47:08,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:47:08,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:47:08,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:47:08,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:47:08,537 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:47:08,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:47:08,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:47:08,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:47:08,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:47:08,538 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:47:08,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:47:08,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:47:08,539 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:47:08,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:47:08,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:47:08,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:47:08,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:47:08,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:47:08,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:47:08,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:47:08,546 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:47:08,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:47:08,546 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:47:08,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:47:08,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:47:08,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:47:08,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:47:08,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:47:08,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:47:08,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:47:08,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:47:08,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:47:08,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:47:08,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:47:08,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:47:08,549 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:47:08,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:47:08,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:47:08,556 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 01:47:08,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:47:08,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:47:08,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:47:08,777 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:47:08,777 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:47:08,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i [2023-12-21 01:47:09,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:47:09,937 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:47:09,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i [2023-12-21 01:47:09,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b056a9a/3e4cc47e025040b3b86403312f0c54dd/FLAG93316c6e6 [2023-12-21 01:47:09,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b056a9a/3e4cc47e025040b3b86403312f0c54dd [2023-12-21 01:47:09,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:47:09,961 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:47:09,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:47:09,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:47:09,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:47:09,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:47:09" (1/1) ... [2023-12-21 01:47:09,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b45806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:09, skipping insertion in model container [2023-12-21 01:47:09,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:47:09" (1/1) ... [2023-12-21 01:47:09,990 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:47:10,080 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2023-12-21 01:47:10,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:47:10,141 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:47:10,149 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2023-12-21 01:47:10,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:47:10,206 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:47:10,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10 WrapperNode [2023-12-21 01:47:10,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:47:10,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:47:10,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:47:10,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:47:10,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,260 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2023-12-21 01:47:10,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:47:10,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:47:10,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:47:10,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:47:10,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,297 INFO L175 MemorySlicer]: Split 108 memory accesses to 8 slices as follows [2, 14, 37, 3, 6, 24, 3, 19]. 34 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 2, 5, 1, 1, 3, 1, 1]. The 17 writes are split as follows [0, 2, 5, 1, 2, 3, 1, 3]. [2023-12-21 01:47:10,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:47:10,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:47:10,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:47:10,331 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:47:10,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (1/1) ... [2023-12-21 01:47:10,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:47:10,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:47:10,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 01:47:10,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 01:47:10,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:47:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:47:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:47:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:47:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:47:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:47:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 01:47:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 01:47:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-21 01:47:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:47:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:47:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:47:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:47:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:47:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:47:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 01:47:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 01:47:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:47:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:47:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:47:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:47:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:47:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 01:47:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 01:47:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-21 01:47:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:47:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:47:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 01:47:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-21 01:47:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:47:10,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:47:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:47:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:47:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:47:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:47:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:47:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:47:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 01:47:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 01:47:10,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:47:10,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:47:10,569 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:47:10,571 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:47:10,976 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:47:11,008 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:47:11,008 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:47:11,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:47:11 BoogieIcfgContainer [2023-12-21 01:47:11,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:47:11,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:47:11,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:47:11,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:47:11,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:47:09" (1/3) ... [2023-12-21 01:47:11,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547f902e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:47:11, skipping insertion in model container [2023-12-21 01:47:11,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:10" (2/3) ... [2023-12-21 01:47:11,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547f902e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:47:11, skipping insertion in model container [2023-12-21 01:47:11,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:47:11" (3/3) ... [2023-12-21 01:47:11,016 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-55.i [2023-12-21 01:47:11,028 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:47:11,028 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:47:11,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:47:11,069 INFO L357 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, mHoare=true, 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;@3428da6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:47:11,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:47:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 78 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:47:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-21 01:47:11,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:11,082 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:11,082 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:11,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:11,086 INFO L85 PathProgramCache]: Analyzing trace with hash -996764846, now seen corresponding path program 1 times [2023-12-21 01:47:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:11,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730930116] [2023-12-21 01:47:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:11,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:11,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730930116] [2023-12-21 01:47:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730930116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:11,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:11,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:47:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683102033] [2023-12-21 01:47:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:11,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:47:11,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:11,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:47:11,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:47:11,435 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 78 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:11,479 INFO L93 Difference]: Finished difference Result 181 states and 288 transitions. [2023-12-21 01:47:11,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:47:11,481 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2023-12-21 01:47:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:11,488 INFO L225 Difference]: With dead ends: 181 [2023-12-21 01:47:11,488 INFO L226 Difference]: Without dead ends: 90 [2023-12-21 01:47:11,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:47:11,495 INFO L413 NwaCegarLoop]: 130 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, 130 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 [2023-12-21 01:47:11,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-21 01:47:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-21 01:47:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 76 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:47:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2023-12-21 01:47:11,531 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 108 [2023-12-21 01:47:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:11,532 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2023-12-21 01:47:11,532 INFO L496 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2023-12-21 01:47:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-21 01:47:11,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:11,536 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:11,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:47:11,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:11,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash -887304510, now seen corresponding path program 1 times [2023-12-21 01:47:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106309840] [2023-12-21 01:47:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:11,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:11,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106309840] [2023-12-21 01:47:11,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106309840] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:11,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:11,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600933364] [2023-12-21 01:47:11,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:11,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:11,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:11,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:11,830 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:11,899 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2023-12-21 01:47:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2023-12-21 01:47:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:11,902 INFO L225 Difference]: With dead ends: 185 [2023-12-21 01:47:11,902 INFO L226 Difference]: Without dead ends: 96 [2023-12-21 01:47:11,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:11,905 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 10 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 379 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 [2023-12-21 01:47:11,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 379 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-21 01:47:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2023-12-21 01:47:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.435897435897436) internal successors, (112), 78 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:47:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2023-12-21 01:47:11,913 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 108 [2023-12-21 01:47:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:11,913 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2023-12-21 01:47:11,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2023-12-21 01:47:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-21 01:47:11,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:11,914 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:11,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:47:11,915 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:11,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:11,915 INFO L85 PathProgramCache]: Analyzing trace with hash -832911612, now seen corresponding path program 1 times [2023-12-21 01:47:11,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:11,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255332843] [2023-12-21 01:47:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:11,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255332843] [2023-12-21 01:47:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255332843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:12,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:12,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202716148] [2023-12-21 01:47:12,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:12,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:12,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:12,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:12,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:12,106 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:12,151 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2023-12-21 01:47:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:12,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2023-12-21 01:47:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:12,152 INFO L225 Difference]: With dead ends: 195 [2023-12-21 01:47:12,152 INFO L226 Difference]: Without dead ends: 104 [2023-12-21 01:47:12,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:12,153 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 21 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 381 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 [2023-12-21 01:47:12,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-21 01:47:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2023-12-21 01:47:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:47:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2023-12-21 01:47:12,160 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 108 [2023-12-21 01:47:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:12,161 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2023-12-21 01:47:12,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2023-12-21 01:47:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-21 01:47:12,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:12,163 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:12,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:47:12,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:12,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1642258238, now seen corresponding path program 1 times [2023-12-21 01:47:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324704343] [2023-12-21 01:47:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:12,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:12,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324704343] [2023-12-21 01:47:12,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324704343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:12,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:12,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:12,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900646827] [2023-12-21 01:47:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:12,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:12,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:12,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:12,285 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:12,320 INFO L93 Difference]: Finished difference Result 195 states and 286 transitions. [2023-12-21 01:47:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:12,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2023-12-21 01:47:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:12,322 INFO L225 Difference]: With dead ends: 195 [2023-12-21 01:47:12,322 INFO L226 Difference]: Without dead ends: 102 [2023-12-21 01:47:12,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:12,325 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 12 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:12,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 379 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-21 01:47:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2023-12-21 01:47:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:47:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2023-12-21 01:47:12,331 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 108 [2023-12-21 01:47:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:12,331 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2023-12-21 01:47:12,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2023-12-21 01:47:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-21 01:47:12,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:12,333 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:12,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:47:12,333 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:12,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:12,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1584999936, now seen corresponding path program 1 times [2023-12-21 01:47:12,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:12,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853529345] [2023-12-21 01:47:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853529345] [2023-12-21 01:47:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853529345] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:12,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:12,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311168295] [2023-12-21 01:47:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:12,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:12,455 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:12,479 INFO L93 Difference]: Finished difference Result 195 states and 284 transitions. [2023-12-21 01:47:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2023-12-21 01:47:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:12,481 INFO L225 Difference]: With dead ends: 195 [2023-12-21 01:47:12,481 INFO L226 Difference]: Without dead ends: 100 [2023-12-21 01:47:12,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:12,483 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:12,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 379 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-21 01:47:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2023-12-21 01:47:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:47:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2023-12-21 01:47:12,500 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 108 [2023-12-21 01:47:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:12,500 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2023-12-21 01:47:12,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2023-12-21 01:47:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-21 01:47:12,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:12,501 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:12,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:47:12,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:12,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1584940354, now seen corresponding path program 1 times [2023-12-21 01:47:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:12,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028425222] [2023-12-21 01:47:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028425222] [2023-12-21 01:47:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028425222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:12,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:12,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:12,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544337490] [2023-12-21 01:47:12,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:12,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:12,934 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:13,004 INFO L93 Difference]: Finished difference Result 246 states and 352 transitions. [2023-12-21 01:47:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:13,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2023-12-21 01:47:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:13,006 INFO L225 Difference]: With dead ends: 246 [2023-12-21 01:47:13,006 INFO L226 Difference]: Without dead ends: 149 [2023-12-21 01:47:13,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:13,008 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 116 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:13,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 471 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-21 01:47:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2023-12-21 01:47:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 130 states have internal predecessors, (180), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:47:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2023-12-21 01:47:13,025 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 208 transitions. Word has length 108 [2023-12-21 01:47:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:13,025 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 208 transitions. [2023-12-21 01:47:13,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 208 transitions. [2023-12-21 01:47:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-21 01:47:13,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:13,028 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:13,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:47:13,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:13,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:13,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1892378492, now seen corresponding path program 1 times [2023-12-21 01:47:13,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:13,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399176854] [2023-12-21 01:47:13,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:13,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399176854] [2023-12-21 01:47:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399176854] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:13,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:13,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285409274] [2023-12-21 01:47:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:13,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:13,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:13,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:13,341 INFO L87 Difference]: Start difference. First operand 146 states and 208 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:13,432 INFO L93 Difference]: Finished difference Result 318 states and 450 transitions. [2023-12-21 01:47:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:13,433 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2023-12-21 01:47:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:13,451 INFO L225 Difference]: With dead ends: 318 [2023-12-21 01:47:13,451 INFO L226 Difference]: Without dead ends: 173 [2023-12-21 01:47:13,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:47:13,452 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 101 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:13,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 525 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-21 01:47:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2023-12-21 01:47:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.3893129770992367) internal successors, (182), 132 states have internal predecessors, (182), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 01:47:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 210 transitions. [2023-12-21 01:47:13,459 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 210 transitions. Word has length 108 [2023-12-21 01:47:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:13,459 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 210 transitions. [2023-12-21 01:47:13,459 INFO L496 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 210 transitions. [2023-12-21 01:47:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 01:47:13,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:13,460 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:13,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:47:13,461 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:13,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash -867930780, now seen corresponding path program 1 times [2023-12-21 01:47:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:13,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011675977] [2023-12-21 01:47:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:13,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:13,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011675977] [2023-12-21 01:47:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011675977] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:13,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299425126] [2023-12-21 01:47:13,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:13,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:13,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:13,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:13,763 INFO L87 Difference]: Start difference. First operand 148 states and 210 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:13,854 INFO L93 Difference]: Finished difference Result 444 states and 630 transitions. [2023-12-21 01:47:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:13,854 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-21 01:47:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:13,856 INFO L225 Difference]: With dead ends: 444 [2023-12-21 01:47:13,856 INFO L226 Difference]: Without dead ends: 297 [2023-12-21 01:47:13,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:47:13,857 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 184 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:13,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 607 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-21 01:47:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2023-12-21 01:47:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 260 states have (on average 1.373076923076923) internal successors, (357), 262 states have internal predecessors, (357), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 01:47:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 413 transitions. [2023-12-21 01:47:13,870 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 413 transitions. Word has length 110 [2023-12-21 01:47:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:13,870 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 413 transitions. [2023-12-21 01:47:13,870 INFO L496 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 413 transitions. [2023-12-21 01:47:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 01:47:13,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:13,871 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:13,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:47:13,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:13,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1621598182, now seen corresponding path program 1 times [2023-12-21 01:47:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608934] [2023-12-21 01:47:13,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:14,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608934] [2023-12-21 01:47:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:14,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:14,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:14,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756293760] [2023-12-21 01:47:14,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:14,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:14,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:14,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:14,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:14,198 INFO L87 Difference]: Start difference. First operand 293 states and 413 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:14,297 INFO L93 Difference]: Finished difference Result 641 states and 894 transitions. [2023-12-21 01:47:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:14,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-21 01:47:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:14,299 INFO L225 Difference]: With dead ends: 641 [2023-12-21 01:47:14,299 INFO L226 Difference]: Without dead ends: 349 [2023-12-21 01:47:14,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:14,303 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 92 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:14,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 854 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-12-21 01:47:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 223. [2023-12-21 01:47:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 194 states have (on average 1.3608247422680413) internal successors, (264), 194 states have internal predecessors, (264), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:47:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 312 transitions. [2023-12-21 01:47:14,315 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 312 transitions. Word has length 110 [2023-12-21 01:47:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:14,316 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 312 transitions. [2023-12-21 01:47:14,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 312 transitions. [2023-12-21 01:47:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 01:47:14,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:14,317 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:14,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 01:47:14,317 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:14,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1598451169, now seen corresponding path program 1 times [2023-12-21 01:47:14,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:14,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279995519] [2023-12-21 01:47:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:14,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279995519] [2023-12-21 01:47:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279995519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:14,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:14,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:14,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145630678] [2023-12-21 01:47:14,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:14,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:14,601 INFO L87 Difference]: Start difference. First operand 223 states and 312 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:14,671 INFO L93 Difference]: Finished difference Result 609 states and 841 transitions. [2023-12-21 01:47:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-21 01:47:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:14,673 INFO L225 Difference]: With dead ends: 609 [2023-12-21 01:47:14,673 INFO L226 Difference]: Without dead ends: 387 [2023-12-21 01:47:14,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:14,674 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:14,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 629 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-12-21 01:47:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 239. [2023-12-21 01:47:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 210 states have (on average 1.3666666666666667) internal successors, (287), 210 states have internal predecessors, (287), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:47:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 335 transitions. [2023-12-21 01:47:14,683 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 335 transitions. Word has length 110 [2023-12-21 01:47:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:14,684 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 335 transitions. [2023-12-21 01:47:14,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 335 transitions. [2023-12-21 01:47:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 01:47:14,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:14,685 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:14,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:47:14,685 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:14,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1011645155, now seen corresponding path program 1 times [2023-12-21 01:47:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341593767] [2023-12-21 01:47:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:14,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341593767] [2023-12-21 01:47:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341593767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846488748] [2023-12-21 01:47:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:14,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:14,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:14,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:14,812 INFO L87 Difference]: Start difference. First operand 239 states and 335 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:14,852 INFO L93 Difference]: Finished difference Result 515 states and 721 transitions. [2023-12-21 01:47:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:14,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-21 01:47:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:14,855 INFO L225 Difference]: With dead ends: 515 [2023-12-21 01:47:14,855 INFO L226 Difference]: Without dead ends: 277 [2023-12-21 01:47:14,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:14,856 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 56 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:14,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 502 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-12-21 01:47:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 245. [2023-12-21 01:47:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 216 states have (on average 1.3564814814814814) internal successors, (293), 216 states have internal predecessors, (293), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:47:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 341 transitions. [2023-12-21 01:47:14,866 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 341 transitions. Word has length 110 [2023-12-21 01:47:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:14,866 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 341 transitions. [2023-12-21 01:47:14,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 341 transitions. [2023-12-21 01:47:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-21 01:47:14,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:14,867 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:14,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 01:47:14,867 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:14,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1982862013, now seen corresponding path program 1 times [2023-12-21 01:47:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:14,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981249975] [2023-12-21 01:47:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981249975] [2023-12-21 01:47:14,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981249975] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:14,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:14,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910091431] [2023-12-21 01:47:14,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:14,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:14,979 INFO L87 Difference]: Start difference. First operand 245 states and 341 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:15,020 INFO L93 Difference]: Finished difference Result 553 states and 765 transitions. [2023-12-21 01:47:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:15,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2023-12-21 01:47:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:15,022 INFO L225 Difference]: With dead ends: 553 [2023-12-21 01:47:15,022 INFO L226 Difference]: Without dead ends: 309 [2023-12-21 01:47:15,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:15,023 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 54 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:15,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 543 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-21 01:47:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 253. [2023-12-21 01:47:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 224 states have (on average 1.34375) internal successors, (301), 224 states have internal predecessors, (301), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:47:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 349 transitions. [2023-12-21 01:47:15,053 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 349 transitions. Word has length 111 [2023-12-21 01:47:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:15,053 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 349 transitions. [2023-12-21 01:47:15,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 349 transitions. [2023-12-21 01:47:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 01:47:15,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:15,054 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:15,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 01:47:15,054 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:15,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash -484561090, now seen corresponding path program 1 times [2023-12-21 01:47:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:15,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279470] [2023-12-21 01:47:15,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279470] [2023-12-21 01:47:15,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279470] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408269604] [2023-12-21 01:47:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:15,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:15,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:15,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:15,182 INFO L87 Difference]: Start difference. First operand 253 states and 349 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:15,236 INFO L93 Difference]: Finished difference Result 438 states and 600 transitions. [2023-12-21 01:47:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 01:47:15,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-21 01:47:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:15,238 INFO L225 Difference]: With dead ends: 438 [2023-12-21 01:47:15,238 INFO L226 Difference]: Without dead ends: 310 [2023-12-21 01:47:15,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:15,239 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 158 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:15,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 477 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-12-21 01:47:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2023-12-21 01:47:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 234 states have (on average 1.3504273504273505) internal successors, (316), 234 states have internal predecessors, (316), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:47:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 364 transitions. [2023-12-21 01:47:15,247 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 364 transitions. Word has length 113 [2023-12-21 01:47:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:15,247 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 364 transitions. [2023-12-21 01:47:15,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 364 transitions. [2023-12-21 01:47:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 01:47:15,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:15,248 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:15,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 01:47:15,248 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:15,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1505629444, now seen corresponding path program 1 times [2023-12-21 01:47:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317472571] [2023-12-21 01:47:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:15,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:15,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317472571] [2023-12-21 01:47:15,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317472571] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:15,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:15,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:15,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654432964] [2023-12-21 01:47:15,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:15,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:15,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:15,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:15,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:15,329 INFO L87 Difference]: Start difference. First operand 263 states and 364 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:15,359 INFO L93 Difference]: Finished difference Result 639 states and 874 transitions. [2023-12-21 01:47:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 01:47:15,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-21 01:47:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:15,361 INFO L225 Difference]: With dead ends: 639 [2023-12-21 01:47:15,361 INFO L226 Difference]: Without dead ends: 373 [2023-12-21 01:47:15,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:15,362 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 63 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:15,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 406 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-12-21 01:47:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 251. [2023-12-21 01:47:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 222 states have (on average 1.3333333333333333) internal successors, (296), 222 states have internal predecessors, (296), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:47:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 344 transitions. [2023-12-21 01:47:15,371 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 344 transitions. Word has length 113 [2023-12-21 01:47:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:15,371 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 344 transitions. [2023-12-21 01:47:15,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:47:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 344 transitions. [2023-12-21 01:47:15,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 01:47:15,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:15,372 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:15,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 01:47:15,372 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:15,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:15,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1118165245, now seen corresponding path program 1 times [2023-12-21 01:47:15,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:15,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691316194] [2023-12-21 01:47:15,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:15,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:15,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:15,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691316194] [2023-12-21 01:47:15,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691316194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:15,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:15,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:47:15,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154030374] [2023-12-21 01:47:15,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:15,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:47:15,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:47:15,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:15,858 INFO L87 Difference]: Start difference. First operand 251 states and 344 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:15,974 INFO L93 Difference]: Finished difference Result 312 states and 425 transitions. [2023-12-21 01:47:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:15,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-21 01:47:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:15,978 INFO L225 Difference]: With dead ends: 312 [2023-12-21 01:47:15,978 INFO L226 Difference]: Without dead ends: 310 [2023-12-21 01:47:15,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:47:15,979 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 96 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:15,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 850 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-12-21 01:47:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2023-12-21 01:47:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 267 states have (on average 1.3220973782771535) internal successors, (353), 268 states have internal predecessors, (353), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:47:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 421 transitions. [2023-12-21 01:47:15,993 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 421 transitions. Word has length 113 [2023-12-21 01:47:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:15,994 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 421 transitions. [2023-12-21 01:47:15,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 421 transitions. [2023-12-21 01:47:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 01:47:15,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:15,995 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:15,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 01:47:15,996 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:15,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1118105663, now seen corresponding path program 1 times [2023-12-21 01:47:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:15,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396565224] [2023-12-21 01:47:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:47:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:47:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:47:16,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:16,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396565224] [2023-12-21 01:47:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396565224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:16,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:16,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25263576] [2023-12-21 01:47:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:16,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:16,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:16,544 INFO L87 Difference]: Start difference. First operand 309 states and 421 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:16,655 INFO L93 Difference]: Finished difference Result 579 states and 780 transitions. [2023-12-21 01:47:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:16,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-21 01:47:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:16,658 INFO L225 Difference]: With dead ends: 579 [2023-12-21 01:47:16,658 INFO L226 Difference]: Without dead ends: 317 [2023-12-21 01:47:16,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:47:16,659 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 94 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:16,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 756 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-21 01:47:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2023-12-21 01:47:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 273 states have (on average 1.3076923076923077) internal successors, (357), 274 states have internal predecessors, (357), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 01:47:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 425 transitions. [2023-12-21 01:47:16,682 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 425 transitions. Word has length 113 [2023-12-21 01:47:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:16,682 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 425 transitions. [2023-12-21 01:47:16,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:47:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 425 transitions. [2023-12-21 01:47:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 01:47:16,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:16,684 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:16,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 01:47:16,685 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:16,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1060847361, now seen corresponding path program 1 times [2023-12-21 01:47:16,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:16,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31581875] [2023-12-21 01:47:16,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:16,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:47:16,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:47:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:47:16,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:47:16,816 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:47:16,816 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:47:16,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 01:47:16,820 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:16,822 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:47:16,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:47:16 BoogieIcfgContainer [2023-12-21 01:47:16,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:47:16,910 INFO L158 Benchmark]: Toolchain (without parser) took 6949.29ms. Allocated memory was 191.9MB in the beginning and 373.3MB in the end (delta: 181.4MB). Free memory was 144.9MB in the beginning and 204.0MB in the end (delta: -59.1MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. [2023-12-21 01:47:16,910 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:47:16,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.72ms. Allocated memory is still 191.9MB. Free memory was 144.9MB in the beginning and 130.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 01:47:16,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.11ms. Allocated memory is still 191.9MB. Free memory was 130.2MB in the beginning and 126.4MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 01:47:16,911 INFO L158 Benchmark]: Boogie Preprocessor took 70.25ms. Allocated memory is still 191.9MB. Free memory was 126.4MB in the beginning and 120.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-21 01:47:16,911 INFO L158 Benchmark]: RCFGBuilder took 677.42ms. Allocated memory is still 191.9MB. Free memory was 120.8MB in the beginning and 153.3MB in the end (delta: -32.5MB). Peak memory consumption was 31.3MB. Max. memory is 8.0GB. [2023-12-21 01:47:16,911 INFO L158 Benchmark]: TraceAbstraction took 5899.41ms. Allocated memory was 191.9MB in the beginning and 373.3MB in the end (delta: 181.4MB). Free memory was 152.8MB in the beginning and 204.0MB in the end (delta: -51.2MB). Peak memory consumption was 130.2MB. Max. memory is 8.0GB. [2023-12-21 01:47:16,915 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.11ms. Allocated memory is still 191.9MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.72ms. Allocated memory is still 191.9MB. Free memory was 144.9MB in the beginning and 130.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.11ms. Allocated memory is still 191.9MB. Free memory was 130.2MB in the beginning and 126.4MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.25ms. Allocated memory is still 191.9MB. Free memory was 126.4MB in the beginning and 120.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 677.42ms. Allocated memory is still 191.9MB. Free memory was 120.8MB in the beginning and 153.3MB in the end (delta: -32.5MB). Peak memory consumption was 31.3MB. Max. memory is 8.0GB. * TraceAbstraction took 5899.41ms. Allocated memory was 191.9MB in the beginning and 373.3MB in the end (delta: 181.4MB). Free memory was 152.8MB in the beginning and 204.0MB in the end (delta: -51.2MB). Peak memory consumption was 130.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of bitwise operation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L28-L30] float float_Array_0[1] = { 4.6 }; [L28-L30] float float_Array_0[1] = { 4.6 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -5 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -5 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 500 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 500 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[1] = { 10 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[1] = { 10 }; [L43] signed long int last_1_signed_long_int_Array_0_0_ = -5; [L44] unsigned char last_1_unsigned_char_Array_0_0_ = 2; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR signed_long_int_Array_0[0] [L100] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L78] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L82] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] double_Array_0[0] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[0] [L85] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L85] EXPR double_Array_0[0] [L85] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] double_Array_0[1] = __VERIFIER_nondet_double() [L87] EXPR double_Array_0[1] [L87] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L87] EXPR double_Array_0[1] [L87] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] double_Array_0[2] = __VERIFIER_nondet_double() [L89] EXPR double_Array_0[2] [L89] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L89] EXPR double_Array_0[2] [L89] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] double_Array_0[4] = __VERIFIER_nondet_double() [L91] EXPR double_Array_0[4] [L91] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L91] EXPR double_Array_0[4] [L91] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L95] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L112] RET updateVariables() [L113] CALL step() [L48] unsigned char stepLocal_1 = last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_; [L49] signed long int stepLocal_0 = last_1_unsigned_char_Array_0_0_; [L50] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L50] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L59] unsigned_short_int_Array_0[0] = last_1_unsigned_char_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L61] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L61] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L64] EXPR double_Array_0[1] [L64] float_Array_0[0] = double_Array_0[1] [L65] EXPR unsigned_char_Array_0[1] [L65] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[1] [L66] EXPR unsigned_char_Array_0[2] [L66] unsigned_char_Array_0[0] = unsigned_char_Array_0[2] [L67] EXPR unsigned_short_int_Array_0[0] [L67] EXPR -4 >> unsigned_short_int_Array_0[0] [L67] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR (((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0]) [L67] EXPR unsigned_short_int_Array_0[0] [L67] EXPR -4 >> unsigned_short_int_Array_0[0] [L67] EXPR (((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] signed long int stepLocal_3 = ((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])); [L68] EXPR unsigned_short_int_Array_0[0] [L68] signed long int stepLocal_2 = unsigned_short_int_Array_0[0] / -8; [L69] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L69] COND FALSE !((~ unsigned_char_Array_0[0]) <= stepLocal_3) [L74] EXPR unsigned_char_Array_0[0] [L74] EXPR unsigned_char_Array_0[1] [L74] signed_long_int_Array_0[0] = (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_)) [L104] EXPR unsigned_short_int_Array_0[0] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1) [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1 [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1])))) [L104] EXPR unsigned_char_Array_0[0] [L104] EXPR unsigned_short_int_Array_0[0] [L104] EXPR -4 >> unsigned_short_int_Array_0[0] [L104] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0]) [L104] EXPR unsigned_short_int_Array_0[0] [L104] EXPR -4 >> unsigned_short_int_Array_0[0] [L104] EXPR (((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))) [L104] EXPR signed_long_int_Array_0[0] [L104] EXPR unsigned_char_Array_0[0] [L104] EXPR unsigned_char_Array_0[1] [L104] EXPR ((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) [L104] EXPR float_Array_0[0] [L104] EXPR double_Array_0[1] [L104] EXPR (((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104-L105] return (((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[2])) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 17, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1180 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1174 mSDsluCounter, 8268 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5924 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 883 IncrementalHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 2344 mSDtfsCounter, 883 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=16, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 586 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1872 NumberOfCodeBlocks, 1872 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1743 ConstructedInterpolants, 0 QuantifiedInterpolants, 5289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 4224/4224 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 [2023-12-21 01:47:16,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...