/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-38.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:45:15,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:45:15,413 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:45:15,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:45:15,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:45:15,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:45:15,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:45:15,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:45:15,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:45:15,437 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:45:15,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:45:15,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:45:15,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:45:15,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:45:15,438 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:45:15,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:45:15,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:45:15,439 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:45:15,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:45:15,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:45:15,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:45:15,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:45:15,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:45:15,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:45:15,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:45:15,449 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:45:15,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:45:15,449 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:45:15,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:45:15,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:45:15,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:45:15,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:45:15,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:45:15,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:45:15,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:45:15,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:45:15,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:45:15,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:45:15,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:45:15,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:45:15,451 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:45:15,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:45:15,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:45:15,453 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:45:15,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:45:15,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:45:15,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:45:15,634 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:45:15,634 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:45:15,635 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-38.i [2023-12-21 01:45:16,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:45:16,841 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:45:16,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2023-12-21 01:45:16,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d37f336/fd188792d6bc43dbbab091caf70dcf58/FLAGa9c5e7d91 [2023-12-21 01:45:16,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d37f336/fd188792d6bc43dbbab091caf70dcf58 [2023-12-21 01:45:16,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:45:16,864 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:45:16,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:45:16,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:45:16,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:45:16,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:45:16" (1/1) ... [2023-12-21 01:45:16,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dad159e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:16, skipping insertion in model container [2023-12-21 01:45:16,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:45:16" (1/1) ... [2023-12-21 01:45:16,897 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:45:16,991 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-38.i[916,929] [2023-12-21 01:45:17,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:45:17,043 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:45:17,051 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-38.i[916,929] [2023-12-21 01:45:17,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:45:17,107 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:45:17,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17 WrapperNode [2023-12-21 01:45:17,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:45:17,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:45:17,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:45:17,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:45:17,113 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:45:17" (1/1) ... [2023-12-21 01:45:17,125 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:45:17" (1/1) ... [2023-12-21 01:45:17,158 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2023-12-21 01:45:17,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:45:17,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:45:17,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:45:17,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:45:17,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,203 INFO L175 MemorySlicer]: Split 141 memory accesses to 5 slices as follows [2, 22, 35, 9, 73]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 9]. The 21 writes are split as follows [0, 3, 5, 2, 11]. [2023-12-21 01:45:17,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:45:17,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:45:17,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:45:17,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:45:17,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (1/1) ... [2023-12-21 01:45:17,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:45:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:45:17,287 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:45:17,308 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:45:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:45:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:45:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:45:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:45:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:45:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:45:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:45:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:45:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:45:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:45:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:45:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:45:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:45:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:45:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:45:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:45:17,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:45:17,320 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:45:17,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:45:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:45:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:45:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:45:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:45:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:45:17,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:45:17,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:45:17,449 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:45:17,450 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:45:17,815 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:45:17,840 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:45:17,841 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:45:17,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:45:17 BoogieIcfgContainer [2023-12-21 01:45:17,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:45:17,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:45:17,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:45:17,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:45:17,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:45:16" (1/3) ... [2023-12-21 01:45:17,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee38c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:45:17, skipping insertion in model container [2023-12-21 01:45:17,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:45:17" (2/3) ... [2023-12-21 01:45:17,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee38c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:45:17, skipping insertion in model container [2023-12-21 01:45:17,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:45:17" (3/3) ... [2023-12-21 01:45:17,847 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-38.i [2023-12-21 01:45:17,869 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:45:17,869 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:45:17,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:45:17,907 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;@71669ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:45:17,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:45:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:45:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 01:45:17,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:17,924 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:17,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1330659450, now seen corresponding path program 1 times [2023-12-21 01:45:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:17,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122833059] [2023-12-21 01:45:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:17,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:45:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:45:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:45:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:45:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:45:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:45:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:45:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:45:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:45:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:45:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:45:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:45:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:45:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:45:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:45:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:45:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:45:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:45:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:45:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 01:45:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 01:45:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 01:45:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 01:45:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:18,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122833059] [2023-12-21 01:45:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122833059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:18,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:18,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:45:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128976374] [2023-12-21 01:45:18,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:18,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:45:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:18,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:45:18,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:45:18,391 INFO L87 Difference]: Start difference. First operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 01:45:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:18,444 INFO L93 Difference]: Finished difference Result 227 states and 366 transitions. [2023-12-21 01:45:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:45:18,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2023-12-21 01:45:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:18,453 INFO L225 Difference]: With dead ends: 227 [2023-12-21 01:45:18,454 INFO L226 Difference]: Without dead ends: 113 [2023-12-21 01:45:18,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:45:18,461 INFO L413 NwaCegarLoop]: 163 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, 163 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:45:18,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:45:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-21 01:45:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-21 01:45:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:45:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2023-12-21 01:45:18,515 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 179 [2023-12-21 01:45:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:18,516 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2023-12-21 01:45:18,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-21 01:45:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2023-12-21 01:45:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 01:45:18,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:18,519 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:18,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:45:18,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:18,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1011688926, now seen corresponding path program 1 times [2023-12-21 01:45:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:18,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346067609] [2023-12-21 01:45:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:45:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:45:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:45:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:45:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:45:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:45:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:45:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:45:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:45:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:45:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:45:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:45:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:45:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:45:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:45:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:45:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:45:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:45:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:45:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 01:45:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 01:45:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 01:45:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 01:45:19,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:19,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346067609] [2023-12-21 01:45:19,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346067609] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:19,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:19,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:45:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317841577] [2023-12-21 01:45:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:19,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:45:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:45:19,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:45:19,182 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-21 01:45:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:19,305 INFO L93 Difference]: Finished difference Result 258 states and 381 transitions. [2023-12-21 01:45:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:45:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 179 [2023-12-21 01:45:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:19,310 INFO L225 Difference]: With dead ends: 258 [2023-12-21 01:45:19,311 INFO L226 Difference]: Without dead ends: 146 [2023-12-21 01:45:19,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:45:19,314 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 44 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:19,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 596 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:45:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-21 01:45:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2023-12-21 01:45:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:45:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2023-12-21 01:45:19,334 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 179 [2023-12-21 01:45:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:19,336 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2023-12-21 01:45:19,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-21 01:45:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2023-12-21 01:45:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 01:45:19,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:19,338 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:19,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:45:19,338 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:19,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 992297442, now seen corresponding path program 1 times [2023-12-21 01:45:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761255417] [2023-12-21 01:45:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:19,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:45:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:45:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:45:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:45:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:45:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:45:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:45:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:45:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:45:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:45:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:45:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:45:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:45:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:45:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:45:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:45:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:45:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:45:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:45:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 01:45:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 01:45:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 01:45:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 01:45:21,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:21,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761255417] [2023-12-21 01:45:21,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761255417] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:21,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:21,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 01:45:21,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103271329] [2023-12-21 01:45:21,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:21,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 01:45:21,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:21,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 01:45:21,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:45:21,477 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 12 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2023-12-21 01:45:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:23,069 INFO L93 Difference]: Finished difference Result 412 states and 608 transitions. [2023-12-21 01:45:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 01:45:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 179 [2023-12-21 01:45:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:23,072 INFO L225 Difference]: With dead ends: 412 [2023-12-21 01:45:23,072 INFO L226 Difference]: Without dead ends: 297 [2023-12-21 01:45:23,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-12-21 01:45:23,073 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 309 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:23,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1654 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 01:45:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-21 01:45:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 217. [2023-12-21 01:45:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.3662790697674418) internal successors, (235), 173 states have internal predecessors, (235), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:45:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 319 transitions. [2023-12-21 01:45:23,094 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 319 transitions. Word has length 179 [2023-12-21 01:45:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:23,095 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 319 transitions. [2023-12-21 01:45:23,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2023-12-21 01:45:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 319 transitions. [2023-12-21 01:45:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 01:45:23,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:23,097 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:23,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:45:23,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:23,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1250462880, now seen corresponding path program 1 times [2023-12-21 01:45:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:23,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288845953] [2023-12-21 01:45:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:45:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:45:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:45:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:45:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:45:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:45:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:45:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:45:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:45:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:45:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:45:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:45:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:45:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:45:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:45:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:45:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:45:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:45:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:45:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 01:45:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 01:45:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 01:45:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 01:45:24,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:24,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288845953] [2023-12-21 01:45:24,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288845953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:24,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:24,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:45:24,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286896551] [2023-12-21 01:45:24,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:24,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:45:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:24,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:45:24,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:45:24,391 INFO L87 Difference]: Start difference. First operand 217 states and 319 transitions. Second operand has 11 states, 7 states have (on average 8.857142857142858) internal successors, (62), 11 states have internal predecessors, (62), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2023-12-21 01:45:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:25,229 INFO L93 Difference]: Finished difference Result 624 states and 916 transitions. [2023-12-21 01:45:25,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 01:45:25,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 8.857142857142858) internal successors, (62), 11 states have internal predecessors, (62), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) Word has length 179 [2023-12-21 01:45:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:25,233 INFO L225 Difference]: With dead ends: 624 [2023-12-21 01:45:25,233 INFO L226 Difference]: Without dead ends: 408 [2023-12-21 01:45:25,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-12-21 01:45:25,235 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 363 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:25,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1143 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 01:45:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-12-21 01:45:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 316. [2023-12-21 01:45:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 250 states have (on average 1.36) internal successors, (340), 252 states have internal predecessors, (340), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2023-12-21 01:45:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 464 transitions. [2023-12-21 01:45:25,268 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 464 transitions. Word has length 179 [2023-12-21 01:45:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:25,269 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 464 transitions. [2023-12-21 01:45:25,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 8.857142857142858) internal successors, (62), 11 states have internal predecessors, (62), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2023-12-21 01:45:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 464 transitions. [2023-12-21 01:45:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 01:45:25,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:25,271 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:25,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:45:25,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:25,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:25,271 INFO L85 PathProgramCache]: Analyzing trace with hash -696646300, now seen corresponding path program 1 times [2023-12-21 01:45:25,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:25,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126202788] [2023-12-21 01:45:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:45:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:45:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:45:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:45:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:45:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:45:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:45:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:45:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:45:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:45:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:45:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:45:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:45:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:45:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:45:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:45:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:45:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:45:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:45:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 01:45:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 01:45:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 01:45:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 01:45:26,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126202788] [2023-12-21 01:45:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126202788] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:26,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:26,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 01:45:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41978587] [2023-12-21 01:45:26,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:26,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 01:45:26,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:26,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 01:45:26,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-12-21 01:45:26,757 INFO L87 Difference]: Start difference. First operand 316 states and 464 transitions. Second operand has 13 states, 8 states have (on average 7.75) internal successors, (62), 13 states have internal predecessors, (62), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-21 01:45:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:27,971 INFO L93 Difference]: Finished difference Result 695 states and 1019 transitions. [2023-12-21 01:45:27,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 01:45:27,972 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 8 states have (on average 7.75) internal successors, (62), 13 states have internal predecessors, (62), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 179 [2023-12-21 01:45:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:27,974 INFO L225 Difference]: With dead ends: 695 [2023-12-21 01:45:27,974 INFO L226 Difference]: Without dead ends: 380 [2023-12-21 01:45:27,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-12-21 01:45:27,975 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 247 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:27,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1846 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 01:45:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-12-21 01:45:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 279. [2023-12-21 01:45:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 215 states have internal predecessors, (286), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2023-12-21 01:45:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 410 transitions. [2023-12-21 01:45:28,023 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 410 transitions. Word has length 179 [2023-12-21 01:45:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:28,023 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 410 transitions. [2023-12-21 01:45:28,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 8 states have (on average 7.75) internal successors, (62), 13 states have internal predecessors, (62), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2023-12-21 01:45:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 410 transitions. [2023-12-21 01:45:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 01:45:28,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:28,026 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:28,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:45:28,026 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:28,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:28,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1414999268, now seen corresponding path program 1 times [2023-12-21 01:45:28,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:28,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475839241] [2023-12-21 01:45:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:28,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:45:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:45:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:45:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:45:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:45:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:45:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:45:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:45:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:45:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:45:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:45:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:45:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:45:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:45:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:45:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:45:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:45:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:45:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:45:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 01:45:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 01:45:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 01:45:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 01:45:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:28,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475839241] [2023-12-21 01:45:28,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475839241] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:28,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:28,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:45:28,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765694851] [2023-12-21 01:45:28,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:28,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:45:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:28,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:45:28,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:45:28,756 INFO L87 Difference]: Start difference. First operand 279 states and 410 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-21 01:45:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:29,111 INFO L93 Difference]: Finished difference Result 508 states and 738 transitions. [2023-12-21 01:45:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:45:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2023-12-21 01:45:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:29,113 INFO L225 Difference]: With dead ends: 508 [2023-12-21 01:45:29,113 INFO L226 Difference]: Without dead ends: 286 [2023-12-21 01:45:29,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:45:29,115 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 171 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:29,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1167 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:45:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-21 01:45:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 219. [2023-12-21 01:45:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 173 states have (on average 1.346820809248555) internal successors, (233), 174 states have internal predecessors, (233), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:45:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 317 transitions. [2023-12-21 01:45:29,162 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 317 transitions. Word has length 179 [2023-12-21 01:45:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:29,162 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 317 transitions. [2023-12-21 01:45:29,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-21 01:45:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 317 transitions. [2023-12-21 01:45:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-21 01:45:29,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:29,164 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:29,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:45:29,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:29,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1673164706, now seen corresponding path program 1 times [2023-12-21 01:45:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171307561] [2023-12-21 01:45:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:45:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:45:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:45:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:45:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:45:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:45:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:45:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:45:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:45:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:45:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:45:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:45:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:45:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:45:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:45:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:45:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:45:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:45:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:45:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 01:45:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 01:45:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 01:45:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 01:45:30,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:30,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171307561] [2023-12-21 01:45:30,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171307561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:30,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:30,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:45:30,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842907614] [2023-12-21 01:45:30,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:30,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:45:30,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:30,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:45:30,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:45:30,044 INFO L87 Difference]: Start difference. First operand 219 states and 317 transitions. Second operand has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-21 01:45:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:30,608 INFO L93 Difference]: Finished difference Result 500 states and 724 transitions. [2023-12-21 01:45:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:45:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2023-12-21 01:45:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:30,611 INFO L225 Difference]: With dead ends: 500 [2023-12-21 01:45:30,611 INFO L226 Difference]: Without dead ends: 282 [2023-12-21 01:45:30,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-21 01:45:30,614 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 197 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:30,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1851 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:45:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-21 01:45:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 195. [2023-12-21 01:45:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 149 states have (on average 1.3221476510067114) internal successors, (197), 150 states have internal predecessors, (197), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:45:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 281 transitions. [2023-12-21 01:45:30,656 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 281 transitions. Word has length 179 [2023-12-21 01:45:30,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:30,660 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 281 transitions. [2023-12-21 01:45:30,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-21 01:45:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 281 transitions. [2023-12-21 01:45:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-21 01:45:30,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:30,661 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:30,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:45:30,662 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:30,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:30,662 INFO L85 PathProgramCache]: Analyzing trace with hash 482911623, now seen corresponding path program 1 times [2023-12-21 01:45:30,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:30,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163483005] [2023-12-21 01:45:30,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:45:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:45:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:45:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:45:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:45:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:45:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:45:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:45:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:45:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:45:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:45:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:45:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:45:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:45:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:45:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:45:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:45:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:45:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:45:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 01:45:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 01:45:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 01:45:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-21 01:45:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:32,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163483005] [2023-12-21 01:45:32,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163483005] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:32,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:32,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 01:45:32,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175741645] [2023-12-21 01:45:32,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:32,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 01:45:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 01:45:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:45:32,412 INFO L87 Difference]: Start difference. First operand 195 states and 281 transitions. Second operand has 12 states, 9 states have (on average 7.111111111111111) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2023-12-21 01:45:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:33,456 INFO L93 Difference]: Finished difference Result 550 states and 786 transitions. [2023-12-21 01:45:33,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 01:45:33,456 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.111111111111111) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 181 [2023-12-21 01:45:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:33,458 INFO L225 Difference]: With dead ends: 550 [2023-12-21 01:45:33,458 INFO L226 Difference]: Without dead ends: 412 [2023-12-21 01:45:33,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2023-12-21 01:45:33,460 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 462 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:33,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1642 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 01:45:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-12-21 01:45:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 374. [2023-12-21 01:45:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 295 states have (on average 1.3322033898305086) internal successors, (393), 298 states have internal predecessors, (393), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 01:45:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 537 transitions. [2023-12-21 01:45:33,538 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 537 transitions. Word has length 181 [2023-12-21 01:45:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:33,539 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 537 transitions. [2023-12-21 01:45:33,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.111111111111111) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2023-12-21 01:45:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 537 transitions. [2023-12-21 01:45:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-21 01:45:33,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:33,540 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:33,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:45:33,541 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:33,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1292258249, now seen corresponding path program 1 times [2023-12-21 01:45:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:33,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504311634] [2023-12-21 01:45:33,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:45:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:45:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:45:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:45:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:45:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:45:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:45:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:45:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:45:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:45:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:45:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:45:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:45:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:45:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:45:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:45:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:45:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:45:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:45:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 01:45:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 01:45:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 01:45:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2023-12-21 01:45:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504311634] [2023-12-21 01:45:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504311634] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:45:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967617170] [2023-12-21 01:45:34,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:45:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:45:34,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:45:34,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 01:45:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:35,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-21 01:45:35,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:45:35,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2023-12-21 01:45:35,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2023-12-21 01:45:35,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 33 [2023-12-21 01:45:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 383 proven. 12 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2023-12-21 01:45:35,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:45:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 120 proven. 15 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-12-21 01:45:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967617170] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 01:45:35,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 01:45:35,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 28 [2023-12-21 01:45:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140408932] [2023-12-21 01:45:35,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 01:45:35,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 01:45:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:35,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 01:45:35,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2023-12-21 01:45:35,982 INFO L87 Difference]: Start difference. First operand 374 states and 537 transitions. Second operand has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 28 states have internal predecessors, (107), 11 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (33), 5 states have call predecessors, (33), 11 states have call successors, (33) [2023-12-21 01:45:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:37,462 INFO L93 Difference]: Finished difference Result 628 states and 882 transitions. [2023-12-21 01:45:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-21 01:45:37,476 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 28 states have internal predecessors, (107), 11 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (33), 5 states have call predecessors, (33), 11 states have call successors, (33) Word has length 181 [2023-12-21 01:45:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:37,478 INFO L225 Difference]: With dead ends: 628 [2023-12-21 01:45:37,478 INFO L226 Difference]: Without dead ends: 311 [2023-12-21 01:45:37,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 400 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=540, Invalid=2216, Unknown=0, NotChecked=0, Total=2756 [2023-12-21 01:45:37,480 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 758 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:37,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1148 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 01:45:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-21 01:45:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 147. [2023-12-21 01:45:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 117 states have internal predecessors, (149), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:45:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 197 transitions. [2023-12-21 01:45:37,515 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 197 transitions. Word has length 181 [2023-12-21 01:45:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:37,515 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 197 transitions. [2023-12-21 01:45:37,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 4.863636363636363) internal successors, (107), 28 states have internal predecessors, (107), 11 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (33), 5 states have call predecessors, (33), 11 states have call successors, (33) [2023-12-21 01:45:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 197 transitions. [2023-12-21 01:45:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-21 01:45:37,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:37,518 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:37,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 01:45:37,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:45:37,727 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:37,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1878942643, now seen corresponding path program 1 times [2023-12-21 01:45:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:37,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475803240] [2023-12-21 01:45:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:37,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:45:37,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:45:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:45:38,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:45:38,010 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:45:38,011 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:45:38,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:45:38,016 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:45:38,019 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:45:38,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:45:38 BoogieIcfgContainer [2023-12-21 01:45:38,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:45:38,109 INFO L158 Benchmark]: Toolchain (without parser) took 21244.74ms. Allocated memory was 268.4MB in the beginning and 695.2MB in the end (delta: 426.8MB). Free memory was 230.3MB in the beginning and 614.2MB in the end (delta: -383.9MB). Peak memory consumption was 343.1MB. Max. memory is 8.0GB. [2023-12-21 01:45:38,109 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 208.7MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:45:38,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.44ms. Allocated memory is still 268.4MB. Free memory was 230.3MB in the beginning and 214.2MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 01:45:38,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.70ms. Allocated memory is still 268.4MB. Free memory was 214.2MB in the beginning and 209.4MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 01:45:38,110 INFO L158 Benchmark]: Boogie Preprocessor took 100.80ms. Allocated memory is still 268.4MB. Free memory was 209.4MB in the beginning and 203.5MB in the end (delta: 5.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 01:45:38,110 INFO L158 Benchmark]: RCFGBuilder took 580.54ms. Allocated memory is still 268.4MB. Free memory was 203.5MB in the beginning and 225.1MB in the end (delta: -21.6MB). Peak memory consumption was 32.8MB. Max. memory is 8.0GB. [2023-12-21 01:45:38,111 INFO L158 Benchmark]: TraceAbstraction took 20265.94ms. Allocated memory was 268.4MB in the beginning and 695.2MB in the end (delta: 426.8MB). Free memory was 224.1MB in the beginning and 614.2MB in the end (delta: -390.1MB). Peak memory consumption was 336.6MB. Max. memory is 8.0GB. [2023-12-21 01:45:38,112 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.10ms. Allocated memory is still 208.7MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.44ms. Allocated memory is still 268.4MB. Free memory was 230.3MB in the beginning and 214.2MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.70ms. Allocated memory is still 268.4MB. Free memory was 214.2MB in the beginning and 209.4MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 100.80ms. Allocated memory is still 268.4MB. Free memory was 209.4MB in the beginning and 203.5MB in the end (delta: 5.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 580.54ms. Allocated memory is still 268.4MB. Free memory was 203.5MB in the beginning and 225.1MB in the end (delta: -21.6MB). Peak memory consumption was 32.8MB. Max. memory is 8.0GB. * TraceAbstraction took 20265.94ms. Allocated memory was 268.4MB in the beginning and 695.2MB in the end (delta: 426.8MB). Free memory was 224.1MB in the beginning and 614.2MB in the end (delta: -390.1MB). Peak memory consumption was 336.6MB. 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 100, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L58] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L59] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L61] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L62] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L64] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] double_Array_0[0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] double_Array_0[1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] double_Array_0[2] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] double_Array_0[4] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L76] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L79] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L82] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] unsigned_short_int_Array_0[2][1] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L93] unsigned_short_int_Array_0[1][2] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR unsigned_short_int_Array_0[2][1] [L37] unsigned_short_int_Array_0[2][2] = (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]) [L38] EXPR unsigned_short_int_Array_0[1][2] [L38] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[1][2]; [L39] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND FALSE !(unsigned_short_int_Array_0[2][1] > stepLocal_0) [L42] EXPR double_Array_0[1] [L42] EXPR double_Array_0[0] [L42] EXPR double_Array_0[2] [L42] EXPR double_Array_0[4] [L42] double_Array_0[3] = (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))) [L43] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L43] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L44] EXPR unsigned_short_int_Array_0[0][2] [L44] EXPR unsigned_short_int_Array_0[0][1] [L44] EXPR unsigned_short_int_Array_0[1][1] [L44] unsigned_short_int_Array_0[0][0] = (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])) [L52] EXPR BOOL_unsigned_char_Array_0[2] [L52] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[2]; [L53] EXPR BOOL_unsigned_char_Array_0[0] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, stepLocal_0=65534, stepLocal_1=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] COND FALSE !((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && stepLocal_1) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR unsigned_short_int_Array_0[2][2] [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) [L100] EXPR double_Array_0[3] [L100] EXPR double_Array_0[1] [L100] EXPR double_Array_0[0] [L100] EXPR double_Array_0[2] [L100] EXPR double_Array_0[4] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100-L101] return ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) ; [L110] RET, EXPR property() [L110] 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}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 10, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2591 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2551 mSDsluCounter, 11210 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9449 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6312 IncrementalHoareTripleChecker+Invalid, 6797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 1761 mSDtfsCounter, 6312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1008 GetRequests, 860 SyntacticMatches, 8 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=374occurred in iteration=8, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 659 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 1977 NumberOfCodeBlocks, 1977 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1966 ConstructedInterpolants, 0 QuantifiedInterpolants, 9166 SizeOfPredicates, 6 NumberOfNonLiveVariables, 606 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 12099/12144 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:45:38,149 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...